Home
last modified time | relevance | path

Searched refs:leaves (Results 1 – 25 of 68) sorted by relevance

123

/Linux-v4.19/arch/riscv/kernel/
Dcacheinfo.c38 int levels = 0, leaves = 0, level; in __init_cache_level() local
41 ++leaves; in __init_cache_level()
43 ++leaves; in __init_cache_level()
45 ++leaves; in __init_cache_level()
46 if (leaves > 0) in __init_cache_level()
57 ++leaves; in __init_cache_level()
59 ++leaves; in __init_cache_level()
61 ++leaves; in __init_cache_level()
66 this_cpu_ci->num_leaves = leaves; in __init_cache_level()
/Linux-v4.19/arch/mips/kernel/
Dcacheinfo.c35 int levels = 0, leaves = 0; in __init_cache_level() local
47 leaves += (c->icache.waysize) ? 2 : 1; in __init_cache_level()
51 leaves++; in __init_cache_level()
56 leaves++; in __init_cache_level()
60 this_cpu_ci->num_leaves = leaves; in __init_cache_level()
/Linux-v4.19/arch/arm64/kernel/
Dcacheinfo.c50 unsigned int ctype, level, leaves, fw_level; in __init_cache_level() local
53 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { in __init_cache_level()
60 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in __init_cache_level()
74 leaves += (fw_level - level); in __init_cache_level()
79 this_cpu_ci->num_leaves = leaves; in __init_cache_level()
/Linux-v4.19/arch/s390/kernel/
Dcache.c131 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-v4.19/Documentation/core-api/
Dassoc_array.rst228 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 …]
Dflexible-arrays.rst117 This call frees all elements, but leaves the array itself in place.
/Linux-v4.19/Documentation/virtual/kvm/
D00-INDEX11 - KVM-specific cpuid leaves (x86).
/Linux-v4.19/arch/x86/include/asm/
Dprocessor.h959 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
967 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
/Linux-v4.19/tools/power/pm-graph/config/
Dcgskip.txt7 # as leaves with no child calls. It can be editted by
/Linux-v4.19/Documentation/networking/
Dfib_trie.txt32 searching, making it necessary to save the keys in the leaves to
50 (in other words, they aren't NULL or leaves and their "pos" is equal
99 leaves which have to be removed.
Dbaycom.txt53 to the parallel port, hence the name. The modem leaves the
/Linux-v4.19/kernel/power/
Dsnapshot.c362 struct list_head leaves; /* Radix Tree leaves */ member
459 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); in add_rtree_block()
516 INIT_LIST_HEAD(&zone->leaves); in create_zone_bm_rtree()
546 list_for_each_entry(node, &zone->leaves, list) in free_zone_bm_rtree()
554 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
842 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
855 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
916 list_for_each_entry(node, &zone->leaves, list) in recycle_zone_bm_rtree()
/Linux-v4.19/arch/mips/loongson64/
DPlatform28 # as MIPS64 R2; older versions as just R1. This leaves the possibility open
/Linux-v4.19/Documentation/devicetree/bindings/
DABI.txt7 "That still leaves the question of, what does a stable binding look
/Linux-v4.19/Documentation/filesystems/
Dqnx6.txt60 Data leaves are always on the lowest level. So no data is stored on upper
129 Each data block (tree leaves) holds one long filename. That filename is
/Linux-v4.19/net/ipv4/
Dfib_trie.c172 unsigned int leaves; member
2220 s->leaves++; in trie_collect_stats()
2244 if (stat->leaves) in trie_show_stats()
2245 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2253 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2254 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
/Linux-v4.19/fs/gfs2/
Ddir.c1380 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1392 if (leaves == 0) in gfs2_dir_read_leaf()
1395 leaves++; in gfs2_dir_read_leaf()
1415 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1418 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
/Linux-v4.19/Documentation/RCU/
Dlockdep.txt4 aware of when each task enters and leaves any flavor of RCU read-side
/Linux-v4.19/Documentation/leds/
Dleds-class.txt51 above leaves scope for further attributes should they be needed. If sections
/Linux-v4.19/Documentation/timers/
Dhighres.txt225 hrtimer_restart_sched_tick() is called when the CPU leaves the idle state before
237 The implementation leaves room for further development like full tickless
/Linux-v4.19/Documentation/
Dflexible-arrays.txt116 This call frees all elements, but leaves the array itself in place.
Dpadata.txt140 need not be completed during this call, but, if parallel() leaves work
/Linux-v4.19/drivers/usb/
DKconfig57 leaves and the inner nodes are special USB devices called hubs.
/Linux-v4.19/fs/btrfs/
Drelocation.c100 struct list_head leaves; member
204 INIT_LIST_HEAD(&cache->leaves); in backref_cache_init()
218 while (!list_empty(&cache->leaves)) { in backref_cache_cleanup()
219 node = list_entry(cache->leaves.next, in backref_cache_cleanup()
444 list_add_tail(&upper->lower, &cache->leaves); in remove_backref_node()
1006 list_add_tail(&node->lower, &cache->leaves); in build_backref_tree()
1216 list_add_tail(&new_node->lower, &cache->leaves); in clone_backref_node()
/Linux-v4.19/Documentation/scheduler/
Dsched-rt-group.txt47 relied upon. Which leaves us with just the single fixed portion.

123