| /Linux-v5.10/arch/riscv/kernel/ |
| D | cacheinfo.c | 112 int levels = 0, leaves = 0, level; in __init_cache_level() local
115 ++leaves; in __init_cache_level()
117 ++leaves; in __init_cache_level()
119 ++leaves; in __init_cache_level()
120 if (leaves > 0) in __init_cache_level()
134 ++leaves; in __init_cache_level()
136 ++leaves; in __init_cache_level()
138 ++leaves; in __init_cache_level()
144 this_cpu_ci->num_leaves = leaves; in __init_cache_level()
|
| /Linux-v5.10/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.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()
|
| /Linux-v5.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()
|
| /Linux-v5.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 …]
|
| /Linux-v5.10/arch/x86/include/asm/ |
| D | processor.h | 823 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
831 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /Linux-v5.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
|
| /Linux-v5.10/tools/power/pm-graph/config/ |
| D | cgskip.txt | 7 # as leaves with no child calls. It can be editted by
|
| /Linux-v5.10/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.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.
|
| /Linux-v5.10/kernel/power/ |
| D | snapshot.c | 359 struct list_head leaves; /* Radix Tree leaves */ member
456 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); in add_rtree_block()
513 INIT_LIST_HEAD(&zone->leaves); in create_zone_bm_rtree()
543 list_for_each_entry(node, &zone->leaves, list) in free_zone_bm_rtree()
551 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
846 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
859 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
920 list_for_each_entry(node, &zone->leaves, list) in recycle_zone_bm_rtree()
|
| /Linux-v5.10/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-v5.10/Documentation/devicetree/bindings/ |
| D | ABI.rst | 10 "That still leaves the question of, what does a stable binding look
|
| /Linux-v5.10/arch/mips/loongson64/ |
| D | Platform | 32 # as MIPS64 R2; older versions as just R1. This leaves the possibility open
|
| /Linux-v5.10/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.10/fs/btrfs/ |
| D | backref.h | 244 struct list_head leaves; member
|
| D | backref.c | 2487 INIT_LIST_HEAD(&cache->leaves);
2563 list_add_tail(&upper->lower, &cache->leaves);
2585 while (!list_empty(&cache->leaves)) {
2586 node = list_entry(cache->leaves.next,
2997 list_add_tail(&start->lower, &cache->leaves);
|
| /Linux-v5.10/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-v5.10/fs/gfs2/ |
| D | dir.c | 1377 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1389 if (leaves == 0) in gfs2_dir_read_leaf()
1392 leaves++; in gfs2_dir_read_leaf()
1412 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1415 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
|
| /Linux-v5.10/net/ipv4/ |
| D | fib_trie.c | 159 unsigned int leaves; member
2486 s->leaves++; in trie_collect_stats()
2510 if (stat->leaves) in trie_show_stats()
2511 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2519 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2520 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
|
| /Linux-v5.10/Documentation/RCU/ |
| D | lockdep.rst | 8 aware of when each task enters and leaves any flavor of RCU read-side
|
| /Linux-v5.10/drivers/usb/ |
| D | Kconfig | 58 leaves and the inner nodes are special USB devices called hubs.
|
| /Linux-v5.10/Documentation/timers/ |
| D | highres.rst | 229 hrtimer_restart_sched_tick() is called when the CPU leaves the idle state before
241 The implementation leaves room for further development like full tickless
|
| /Linux-v5.10/Documentation/networking/device_drivers/hamradio/ |
| D | baycom.rst | 59 to the parallel port, hence the name. The modem leaves the
|
| /Linux-v5.10/Documentation/hwmon/ |
| D | pc87360.rst | 159 recommended resistor values for some voltages, but this still leaves much
|
