| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-5.10/arch/riscv/kernel/ |
| H A D | cacheinfo.c | 121 int levels = 0, leaves = 0, level; in init_cache_level() local
124 ++leaves; in init_cache_level()
126 ++leaves; in init_cache_level()
128 ++leaves; in init_cache_level()
129 if (leaves > 0) in init_cache_level()
143 ++leaves; in init_cache_level()
145 ++leaves; in init_cache_level()
147 ++leaves; in init_cache_level()
153 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-5.10/arch/arm64/kernel/ |
| H A D | cacheinfo.c | 48 unsigned int ctype, level, leaves; in init_cache_level() local
52 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { in init_cache_level()
59 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; in init_cache_level()
76 leaves += (fw_level - level); in init_cache_level()
81 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-5.10/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()
49 this_cpu_ci->num_leaves = leaves; in init_cache_level()
|
| /kernel/linux/linux-6.6/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()
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()
232 nvkm_intr_add(const struct nvkm_intr_func *func, const struct nvkm_intr_data *data, struct nvkm_subdev *subdev, int leaves, struct nvkm_intr *intr) nvkm_intr_add() argument
|
| /kernel/linux/linux-6.6/drivers/base/ |
| H A D | cacheinfo.c | 265 unsigned int leaves = 0; in of_count_cache_leaves() local
268 ++leaves; in of_count_cache_leaves()
270 ++leaves; in of_count_cache_leaves()
272 ++leaves; in of_count_cache_leaves()
274 if (!leaves) { in of_count_cache_leaves()
284 return leaves; in of_count_cache_leaves()
292 unsigned int levels = 0, leaves, level; in init_of_cache_level() local
299 leaves = of_count_cache_leaves(np); in init_of_cache_level()
300 if (leaves > 0) in init_of_cache_level()
314 leaves in init_of_cache_level()
[all...] |
| /kernel/linux/linux-6.6/arch/x86/include/asm/ |
| H A D | cpuid.h | 156 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
164 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /kernel/linux/linux-6.6/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 | 66 for (i = 0; i < intr->leaves; i++) in gp100_mc_intr_rearm()
75 for (i = 0; i < intr->leaves; i++) in gp100_mc_intr_unarm()
|
| /kernel/linux/linux-6.6/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 *);
|
| /kernel/linux/linux-5.10/arch/s390/kernel/ |
| H A D | cache.c | 131 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()
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-5.10/arch/x86/include/asm/ |
| H A D | processor.h | 820 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) in hypervisor_cpuid_base() argument
828 (leaves == 0 || ((eax - base) >= leaves))) in hypervisor_cpuid_base()
|
| /kernel/linux/linux-5.10/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
1197 int leaves; emit() local
[all...] |
| /kernel/linux/linux-6.6/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
1197 int leaves; emit() local
[all...] |
| /kernel/linux/linux-5.10/kernel/power/ |
| H A D | snapshot.c | 359 struct list_head leaves; /* Radix Tree leaves */ member
423 * The leave nodes need to be allocated in order to keep the leaves
456 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); in add_rtree_block()
513 INIT_LIST_HEAD(&zone->leaves); in create_zone_bm_rtree()
543 list_for_each_entry(node, &zone->leaves, list) in free_zone_bm_rtree()
551 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
846 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
859 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
920 list_for_each_entry(node, &zone->leaves, lis in recycle_zone_bm_rtree()
[all...] |
| /kernel/linux/linux-6.6/kernel/power/ |
| H A D | snapshot.c | 393 struct list_head leaves; /* Radix Tree leaves */ member
462 * The leave nodes need to be allocated in order to keep the leaves
495 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); in add_rtree_block()
552 INIT_LIST_HEAD(&zone->leaves); in create_zone_bm_rtree()
582 list_for_each_entry(node, &zone->leaves, list) in free_zone_bm_rtree()
590 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
892 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
905 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
968 list_for_each_entry(node, &zone->leaves, lis in recycle_zone_bm_rtree()
[all...] |
| /kernel/linux/linux-5.10/fs/gfs2/ |
| H A D | dir.c | 33 * the block. In leaves, they begin at offset sizeof(struct gfs2_leaf) from the
34 * beginning of the leaf block. The dirents reside in leaves when
40 * When the dirents are in leaves, the actual contents of the directory file are
49 * GFS2_DIR_MAX_DEPTH. After that, leaves are chained together in a linked list,
1377 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1389 if (leaves == 0) in gfs2_dir_read_leaf()
1392 leaves++; in gfs2_dir_read_leaf()
1412 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1415 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
1998 /* Count the number of leaves */ in leaf_dealloc()
[all...] |
| /kernel/linux/linux-6.6/fs/gfs2/ |
| H A D | dir.c | 33 * the block. In leaves, they begin at offset sizeof(struct gfs2_leaf) from the
34 * beginning of the leaf block. The dirents reside in leaves when
40 * When the dirents are in leaves, the actual contents of the directory file are
49 * GFS2_DIR_MAX_DEPTH. After that, leaves are chained together in a linked list,
1375 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1387 if (leaves == 0) in gfs2_dir_read_leaf()
1390 leaves++; in gfs2_dir_read_leaf()
1410 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1413 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
2002 /* Count the number of leaves */ in leaf_dealloc()
[all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | backref.h | 243 struct list_head leaves; member
|
| H A D | backref.c | 2553 INIT_LIST_HEAD(&cache->leaves);
2622 list_add_tail(&upper->lower, &cache->leaves);
2644 while (!list_empty(&cache->leaves)) {
2645 node = list_entry(cache->leaves.next,
3056 list_add_tail(&start->lower, &cache->leaves);
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | backref.h | 100 * cache which maps the logical address (bytenr) of leaves to an array
130 * saving time searching for leaves in a fs tree with file extent items
159 * leaves.
418 struct list_head leaves; member
|
| /kernel/linux/linux-5.10/net/ipv4/ |
| H A D | fib_trie.c | 159 unsigned int leaves; member
1078 * leaves us in position for handling as case 3 in fib_insert_node()
1461 /* Step 2: Sort out leaves and begin backtracing for longest prefix */ in fib_table_lookup()
1928 /* update the suffix to address pulled leaves */ in fib_table_flush_external()
1999 /* update the suffix to address pulled leaves */ in fib_table_flush()
2493 s->leaves++; in trie_collect_stats()
2517 if (stat->leaves) in trie_show_stats()
2518 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2526 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2527 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
[all...] |
| /kernel/linux/linux-6.6/net/ipv4/ |
| H A D | fib_trie.c | 160 unsigned int leaves; member
1125 * leaves us in position for handling as case 3 in fib_insert_node()
1508 /* Step 2: Sort out leaves and begin backtracing for longest prefix */ in fib_table_lookup()
1978 /* update the suffix to address pulled leaves */ in fib_table_flush_external()
2049 /* update the suffix to address pulled leaves */ in fib_table_flush()
2535 s->leaves++; in trie_collect_stats()
2559 if (stat->leaves) in trie_show_stats()
2560 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2568 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2569 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
[all...] |