| /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()
|
| /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/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/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/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/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/include/net/ |
| H A D | net_shaper.h | 55 u32 leaves; /* accounted only for NODE scope */ member
119 const struct net_shaper *leaves,
|
| /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/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/tools/power/pm-graph/config/ |
| H A D | cgskip.txt | 7 # as leaves with no child calls. It can be editted by
|
| /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/fs/unicode/ |
| H A 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/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
|
| H A D | topology.rst | 148 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/Documentation/devicetree/bindings/ |
| H A D | ABI.rst | 10 "That still leaves the question of, what does a stable binding look
|
| /linux/Documentation/filesystems/ |
| H A 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/Documentation/userspace-api/media/v4l/ |
| H A D | pixfmt-yuv-luma.rst | 208 leaves the 6 most significant bits of the last byte padded with 0.
|
| /linux/net/ipv4/ |
| H A D | fib_trie.c | 161 unsigned int leaves; member
1118 * leaves us in position for handling as case 3 in fib_insert_node()
1482 /* Step 2: Sort out leaves and begin backtracing for longest prefix */ in fib_table_lookup()
1949 /* update the suffix to address pulled leaves */ in fib_table_flush_external()
2020 /* update the suffix to address pulled leaves */ in fib_table_flush()
2504 s->leaves++; in trie_collect_stats()
2528 if (stat->leaves) in trie_show_stats()
2529 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2537 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2538 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
[all...] |
| /linux/Documentation/RCU/Design/Data-Structures/ |
| H A 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``.
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/ABI/testing/ |
| H A D | sysfs-driver-uniwill-laptop | 62 Note that setting the maximum cTGP leaves no window open for Dynamic Boost as
|
| /linux/drivers/usb/ |
| H A D | Kconfig | 58 leaves and the inner nodes are special USB devices called hubs.
|
| /linux/Documentation/timers/ |
| H A 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/Documentation/scheduler/ |
| H A D | sched-ext.rst | 348 BPF scheduler's custody. When the task later leaves BPF custody
355 leaves (e.g., when ``ops.dispatch()`` moves it to a terminal DSQ, or
363 When a task leaves BPF scheduler custody, ``ops.dequeue()`` is invoked.
|