Home
last modified time | relevance | path

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

1234

/linux/arch/arm64/kernel/
H A Dcacheinfo.c43 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()
/linux/arch/mips/kernel/
H A Dcacheinfo.c24 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/arch/openrisc/kernel/
H A Dcacheinfo.c33 int leaves = 0, levels = 0; in init_cache_level() local
50 leaves += 1; in init_cache_level()
65 leaves += 1; in init_cache_level()
73 if (!leaves) in init_cache_level()
78 this_cpu_ci->num_leaves = leaves; in init_cache_level()
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dintr.c65 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/drivers/base/
H A Dcacheinfo.c305 unsigned int leaves = 0; in of_count_cache_leaves() local
308 ++leaves; in of_count_cache_leaves()
310 ++leaves; in of_count_cache_leaves()
312 ++leaves; in of_count_cache_leaves()
314 if (!leaves) { in of_count_cache_leaves()
324 return leaves; in of_count_cache_leaves()
331 unsigned int levels = 0, leaves, level; in init_of_cache_level() local
337 leaves = of_count_cache_leaves(np); in init_of_cache_level()
338 if (leaves > 0) in init_of_cache_level()
354 leaves += of_count_cache_leaves(np); in init_of_cache_level()
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/
H A Dnv04.c77 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()
H A Dgp100.c68 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/arch/s390/kernel/
H A Dcache.c128 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/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dintr.h37 int leaves; member
51 struct nvkm_subdev *, int leaves, struct nvkm_intr *);
/linux/Documentation/core-api/
H A 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.
436 To save memory, if a node can hold all the leaves in its portion of keyspace,
437 then the node will have all those leaves in it and will not have any metadata
438 pointers - even if some of those leaves would like to be in the same slot.
440 A node can contain a heterogeneous mix of leaves and metadata pointers.
442 space. The leaves can be in any slot not occupied by a metadata pointer. It
443 is guaranteed that none of the leaves in a node will match a slot occupied by a
[all …]
/linux/tools/power/pm-graph/config/
H A Dcgskip.txt7 # as leaves with no child calls. It can be editted by
/linux/Documentation/networking/
H A Dfib_trie.rst36 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/fs/unicode/
H A Dmkutf8data.c424 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/arch/arm64/boot/dts/qcom/
H A Dsc7280-qcard.dtsi493 * Technically this i2c bus actually leaves the Qcard, but it leaves directly
510 * direction or leaves the pin fully unpowered.
607 * direction or leaves the pin fully unpowered.
H A Dsc7280-idp.dtsi686 * direction or leaves the pin fully unpowered.
791 * direction or leaves the pin fully unpowered.
/linux/Documentation/devicetree/bindings/
H A DABI.rst10 "That still leaves the question of, what does a stable binding look
/linux/Documentation/filesystems/
H A Dqnx6.rst68 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/Documentation/userspace-api/media/v4l/
H A Dpixfmt-yuv-luma.rst208 leaves the 6 most significant bits of the last byte padded with 0.
/linux/fs/gfs2/
H A Ddir.c1376 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1388 if (leaves == 0) in gfs2_dir_read_leaf()
1391 leaves++; in gfs2_dir_read_leaf()
1411 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1414 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
/linux/net/ipv4/
H A Dfib_trie.c161 unsigned int leaves; member
2509 s->leaves++; in trie_collect_stats()
2533 if (stat->leaves) in trie_show_stats()
2534 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2542 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2543 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
/linux/Documentation/RCU/Design/Data-Structures/
H A DData-Structures.rst55 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``.
344 quiescent-state information from the leaves to the root and also that
345 propagates grace-period information from the root down to the leaves.
/linux/Documentation/arch/x86/
H A Dtopology.rst148 specific CPUID leaves which enumerate the processor topology and the cache
151 The CPUID leaves in their preferred order of parsing for each x86 vendor is as
258 On Intel platforms, the CPUID leaves that enumerate the processor
/linux/drivers/usb/
H A DKconfig58 leaves and the inner nodes are special USB devices called hubs.
/linux/Documentation/security/
H A Dipe.rst111 leaves that decision to the system administrator to set the security bar,
240 always risk-free, and blocking a security update leaves systems vulnerable.
332 This leaves the third option. Instead of making users be clever
/linux/Documentation/timers/
H A Dhighres.rst229 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

1234