/linux-master/arch/arm64/kernel/ |
H A D | cacheinfo.c | 43 unsigned int ctype, level, leaves; local 45 for (level = 1, leaves = 0; level <= MAX_CACHE_LEVEL; level++) { 52 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; 56 *leaves_p = leaves; 70 unsigned int level, leaves; local 74 detect_cache_level(&level, &leaves); 90 leaves += (fw_level - level); 95 this_cpu_ci->num_leaves = leaves;
|
/linux-master/arch/mips/kernel/ |
H A D | cacheinfo.c | 24 int levels = 0, leaves = 0; local 36 leaves += (c->icache.waysize) ? 2 : 1; 40 leaves++; 45 leaves++; 50 leaves++; 54 this_cpu_ci->num_leaves = leaves;
|
/linux-master/drivers/gpu/drm/nouveau/include/nvkm/core/ |
H A D | intr.h | 37 int leaves; member in struct:nvkm_intr 51 struct nvkm_subdev *, int leaves, struct nvkm_intr *);
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/mc/ |
H A D | nv04.c | 77 for (leaf = 0; leaf < intr->leaves; leaf++) 87 for (leaf = 0; leaf < intr->leaves; leaf++) 100 for (leaf = 0; leaf < intr->leaves; leaf++) {
|
H A D | gp100.c | 68 for (i = 0; i < intr->leaves; i++) 77 for (i = 0; i < intr->leaves; i++)
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/ |
H A D | intr.c | 65 if (type < intr->leaves * sizeof(*intr->stat) * 8) { 213 for (leaf = 0; leaf < intr->leaves; leaf++) { 233 struct nvkm_subdev *subdev, int leaves, struct nvkm_intr *intr) 241 intr->leaves = leaves; 242 intr->stat = kcalloc(leaves, sizeof(*intr->stat), GFP_KERNEL); 243 intr->mask = kcalloc(leaves, sizeof(*intr->mask), GFP_KERNEL); 250 for (i = 0; i < intr->leaves; i++) 329 for (i = 0; intr->func->block && i < intr->leaves; i++) { 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) argument
|
/linux-master/arch/x86/include/asm/ |
H A D | cpuid.h | 192 static inline uint32_t hypervisor_cpuid_base(const char *sig, uint32_t leaves) argument 200 (leaves == 0 || ((eax - base) >= leaves)))
|
/linux-master/arch/s390/kernel/ |
H A D | cache.c | 128 unsigned int level = 0, leaves = 0; local 140 leaves += (ctype == CACHE_TYPE_SEPARATE) ? 2 : 1; 143 this_cpu_ci->num_leaves = leaves;
|
/linux-master/drivers/base/ |
H A D | cacheinfo.c | 265 unsigned int leaves = 0; local 268 ++leaves; 270 ++leaves; 272 ++leaves; 274 if (!leaves) { 284 return leaves; 292 unsigned int levels = 0, leaves, level; local 299 leaves = of_count_cache_leaves(np); 300 if (leaves > 0) 314 leaves [all...] |
/linux-master/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; local 426 nodes = singletons = leaves = 0; 432 leaves = 1; 456 leaves += 1; 470 leaves += 1; 485 printf("nodes %d leaves %d singletons %d\n", 486 nodes, leaves, singletons); 528 * fully populated and end in identical leaves 1197 int leaves; local [all...] |
/linux-master/kernel/power/ |
H A D | snapshot.c | 395 struct list_head leaves; /* Radix Tree leaves */ member in struct:mem_zone_bm_rtree 464 * The leave nodes need to be allocated in order to keep the leaves 497 block = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->leaves); 554 INIT_LIST_HEAD(&zone->leaves); 584 list_for_each_entry(node, &zone->leaves, list) 592 bm->cur.node = list_entry(bm->cur.zone->leaves.next, 894 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { 907 bm->cur.node = list_entry(bm->cur.zone->leaves.next, 970 list_for_each_entry(node, &zone->leaves, lis [all...] |
/linux-master/fs/btrfs/ |
H A D | backref.h | 112 * cache which maps the logical address (bytenr) of leaves to an array 142 * saving time searching for leaves in a fs tree with file extent items 171 * leaves. 395 struct list_head leaves; member in struct:btrfs_backref_cache
|
H A D | backref.c | 1510 * what's the leaf (or leaves), from a fs tree, that has a file extent 1548 * in different leaves and therefore we have multiple paths. 1695 * Finds all leaves with a reference to the specified combination of 1696 * @ctx->bytenr and @ctx->extent_item_pos. The bytenr of the found leaves are 1957 * items may be located in different leaves and therefore 1958 * some of the leaves may be referenced through shared 1962 * have multiple leaves (which implies multiple paths). 2002 * multiple leaves with file extent items pointing to the same data 3032 INIT_LIST_HEAD(&cache->leaves); 3160 list_add_tail(&upper->lower, &cache->leaves); [all...] |
H A D | relocation.c | 382 * - Freeing up leaves (level 0), keeps nodes detached 434 * Backref nodes for tree leaves are deleted from the cache. 451 * corresponds the tree block, leaves of the backref tree correspond roots of 602 list_add_tail(&new_node->lower, &cache->leaves);
|
/linux-master/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; local 1387 if (leaves == 0) 1390 leaves++; 1410 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); 1413 darr = (struct gfs2_dirent **)(larr + leaves); 2002 /* Count the number of leaves */ [all...] |
/linux-master/net/ipv4/ |
H A D | fib_trie.c | 161 unsigned int leaves; member in struct:trie_stat 1126 * leaves us in position for handling as case 3 1509 /* Step 2: Sort out leaves and begin backtracing for longest prefix */ 1979 /* update the suffix to address pulled leaves */ 2050 /* update the suffix to address pulled leaves */ 2536 s->leaves++; 2560 if (stat->leaves) 2561 avdepth = stat->totdepth*100 / stat->leaves; 2569 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); 2570 bytes = LEAF_SIZE * stat->leaves; [all...] |