Home
last modified time | relevance | path

Searched full:leaves (Results 1 – 25 of 405) sorted by relevance

12345678910>>...17

/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()
H A Dentry-fpsimd.S110 sme_save_za 0, x2, 12 // Leaves x0 pointing to the end of ZA
126 sme_load_za 0, x2, 12 // Leaves x0 pointing to the end of ZA
/linux/Documentation/netlink/specs/
H A Dnet_shaper.yaml59 leaves and root.
126 name: leaves
131 Describes a set of leaves shapers for a @group operation.
267 a @node shaper, reattach all the node's leaves to the
270 leaves and the parent shaper scope is @node, the parent
290 @leaves shapers under the specified node identified by @handle.
291 The @leaves shapers scope must be @queue and the node shaper
296 When updating an existing node shaper, the specified @leaves are
300 of all the leaves, provided all the leaves share the same parent.
325 - leaves
/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/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.
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/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/lib/
H A Dassoc_array.c45 * 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 …]
/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/arch/x86/include/asm/xen/
H A Dcpuid.h34 * 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/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/xfs/
H A Dxfs_attr_inactive.c127 * Recurse (gasp!) through the attribute nodes until we find leaves.
166 * If this is the node level just above the leaves, simply loop in xfs_attr3_node_inactive()
167 * over the leaves removing all of them. If this is higher up in xfs_attr3_node_inactive()
252 * Recurse (gasp!) through the attribute nodes until we find leaves.
/linux/drivers/powercap/
H A Darm_scmi_powercap.c266 /* Un-register children zones first starting from the leaves */ in scmi_powercap_unregister_all_zones()
339 * deregister starting from the leaves.
352 * from the leaves, removing children zones before parents.
356 * leaves in the SCMI powercap zones hierarchy: any non-leaf invalid zone causes
477 * Note that only leaves domains can be skipped, so this could in scmi_powercap_probe()
/linux/fs/jfs/
H A Djfs_dmap.h13 #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/fs/unicode/
H A Dmkutf8data.c145 * 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/fs/btrfs/
H A Ddelayed-inode.h93 * Number of leaves reserved for inserting dir index items (if this
95 * actual number of leaves we end up using. Protected by @mutex.
/linux/tools/lib/
H A Drbtree.c20 * 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/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.
/linux/scripts/kconfig/
H A Dexpr.c98 * against all other leaves. Two equal leaves are both replaced with either 'y'
105 /* Recurse down to leaves */ in __expr_eliminate_eq()
124 /* *ep1 and *ep2 are leaves. Compare them. */ in __expr_eliminate_eq()
133 /* *ep1 and *ep2 are equal leaves. Prepare them for elimination. */ in __expr_eliminate_eq()
477 * against all other leaves to look for simplifications.
483 /* Recurse down to leaves */ in expr_eliminate_dups1()
502 /* *ep1 and *ep2 are leaves. Compare and process them. */ in expr_eliminate_dups1()
/linux/include/linux/
H A Dstackprotector.h11 * by zeroing out the first byte of the canary; this leaves 56 bits of entropy.
/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

12345678910>>...17