| /linux/net/shaper/ |
| H A D | shaper.c | 157 data_race(dst->leaves = src->leaves); in net_shaper_copy()
953 /* Eventually delete the parent, if it is left over with no leaves. */ in __net_shaper_delete()
956 if (shaper && !--shaper->leaves) { in __net_shaper_delete()
976 struct net_shaper *leaves,
990 node, &leaves[i]); in net_shaper_parse_leaves()
996 if (net_shaper_handle_cmp(&leaves[i].handle, in net_shaper_parse_leaves()
997 &leaves[j].handle)) in net_shaper_parse_leaves()
1002 leaves[i].handle.scope, in net_shaper_parse_leaves()
1003 leaves[ in net_shaper_parse_leaves()
980 net_shaper_parse_leaves(struct net_shaper_binding * binding,struct genl_info * info,const struct net_shaper * node,struct net_shaper * leaves,int leaves_count) net_shaper_parse_leaves() argument
1018 net_shaper_parent_from_leaves(int leaves_count,const struct net_shaper * leaves,struct net_shaper * node,struct netlink_ext_ack * extack) net_shaper_parent_from_leaves() argument
1038 __net_shaper_group(struct net_shaper_binding * binding,bool update_node,int leaves_count,struct net_shaper * leaves,struct net_shaper * node,struct netlink_ext_ack * extack) __net_shaper_group() argument
1154 struct net_shaper *cur, *leaves, node = {}; net_shaper_pre_del_node() local
1270 struct net_shaper **old_nodes, *leaves, node = {}; net_shaper_nl_group_doit() local
[all...] |
| /linux/arch/arm64/kernel/ |
| H A D | cacheinfo.c | 43 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 D | entry-fpsimd.S | |
| /linux/Documentation/netlink/specs/ |
| H A D | net_shaper.yaml | 64 leaves and root.
131 name: leaves
136 Describes a set of leaves shapers for a @group operation.
274 a @node shaper, reattach all the node's leaves to the
277 leaves and the parent shaper scope is @node, the parent
297 @leaves shapers under the specified node identified by @handle.
298 The @leaves shapers scope must be @queue and the node shaper
303 When updating an existing node shaper, the specified @leaves are
307 of all the leaves, provided all the leaves share the same parent.
332 - leaves
|
| /linux/arch/mips/kernel/ |
| H A 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/include/net/ |
| H A D | net_shaper.h | 55 u32 leaves; /* accounted only for NODE scope */ member
80 * Nest the @leaves shapers identified under the * @node shaper.
82 * The @leaves arrays size is specified by @leaves_count.
83 * Create either the @leaves and the @node shaper; or if they already
85 * @leaves scope must be NET_SHAPER_SCOPE_QUEUE.
88 const struct net_shaper *leaves,
|
| /linux/Documentation/core-api/ |
| H A 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.
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/arch/openrisc/kernel/ |
| H A D | cacheinfo.c | 33 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 D | assoc_array.c | 45 * 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 D | intr.c | 65 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 = kzalloc_objs(*intr->stat, leaves); in nvkm_intr_add()
243 intr->mask = kzalloc_objs(*intr->mask, leaves); 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/tools/testing/selftests/drivers/net/ |
| H A D | shaper.py | 158 'leaves':[{'handle': {'scope': 'queue', 'id': 1},
180 # Deleting all the leaves shaper does not affect the node one
213 'leaves':[{'handle': {'scope': 'queue', 'id': 1},
241 'leaves':[{'handle': {'scope': 'queue', 'id': 3},
254 'leaves':[{'handle': {'scope': 'queue', 'id': 3},
272 # Deleting a non empty node will move the leaves downstream.
302 'leaves':[{'handle': {'scope': 'queue', 'id': 1},
316 'leaves':[{'handle': {'scope': 'queue', 'id': 1},
349 # Deleting a non empty node will move the leaves downstream.
445 """ Ensure that the kernel rejects duplicate leaves. """
[all …]
|
| /linux/drivers/base/ |
| H A D | cacheinfo.c | 324 unsigned int leaves = 0; in of_count_cache_leaves()
327 ++leaves; in init_of_cache_level()
329 ++leaves; in init_of_cache_level()
331 ++leaves; in init_of_cache_level() local
333 if (!leaves) { in init_of_cache_level()
343 return leaves; in init_of_cache_level()
350 unsigned int levels = 0, leaves, level; in init_of_cache_level()
356 leaves = of_count_cache_leaves(np); in init_of_cache_level()
357 if (leaves > 0) in init_of_cache_level()
373 leaves in cache_setup_acpi()
305 unsigned int leaves = 0; of_count_cache_leaves() local
[all...] |
| /linux/fs/xfs/ |
| H A D | xfs_attr_inactive.c | 127 * 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()
255 * Recurse (gasp!) through the attribute nodes until we find leaves.
299 * mid-truncation leaves an empty leaf rather than one with in xfs_attr3_root_inactive()
|
| /linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/ |
| H A D | nv04.c | 77 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 D | gp100.c | 68 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 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/drivers/gpu/drm/nouveau/include/nvkm/core/ |
| H A D | intr.h | 37 int leaves; member
51 struct nvkm_subdev *, int leaves, struct nvkm_intr *);
|
| /linux/arch/x86/include/asm/xen/ |
| H A D | cpuid.h | 34 * 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 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/drivers/powercap/ |
| H A D | arm_scmi_powercap.c | 266 /* 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/Documentation/arch/x86/ |
| H A D | cpuinfo.rst | 82 Feature flags can be derived from the contents of CPUID leaves
86 leaves and grouped in words with offsets as mapped in enum cpuid_leafs
96 Hardware features enumerated in sparsely populated CPUID leaves get
102 The intent of scattering CPUID leaves is to not bloat struct
|
| /linux/fs/jfs/ |
| H A D | jfs_dmap.h | 13 #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 D | mkutf8data.c | 145 * 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/scripts/kconfig/ |
| H A D | expr.c | 98 * 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/tools/lib/ |
| H A D | rbtree.c | 20 * 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()
|