Home
last modified time | relevance | path

Searched refs:nodes (Results 426 - 434 of 434) sorted by relevance

1...<<1112131415161718

/kernel/linux/linux-6.6/drivers/memory/tegra/
H A Dtegra30-emc.c1478 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended()
1487 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
/kernel/linux/linux-6.6/include/linux/
H A Dsyscalls.h822 const int __user *nodes,
/kernel/linux/linux-6.6/mm/
H A Dhugetlb.c1426 /* Fallback to all nodes if page==NULL */ in dequeue_hugetlb_folio_vma()
2256 * persistent huge pages more or less balanced over allowed nodes.
2273 * nodes with surplus pages. in remove_pool_huge_page()
2491 /* Fallback to all nodes if page==NULL */ in alloc_buddy_hugetlb_folio_with_mpol()
2657 * evenly across all nodes with memory. Iterate across these nodes in return_unused_surplus_pages()
2659 * when the nodes with surplus pages have no free pages. in return_unused_surplus_pages()
2661 * on-line nodes with memory and will handle the hstate accounting. in return_unused_surplus_pages()
4176 * devices of nodes that have memory. All on-line nodes shoul
[all...]
/kernel/linux/linux-5.10/fs/ubifs/
H A Ddebug.c697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (", in ubifs_dump_lprop()
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum, in ubifs_dump_leb()
854 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
1261 ubifs_err(c, "2 xent/dent nodes with the same name"); in dbg_check_key_order()
1305 /* Only dirty zbranch may have no on-flash nodes */ in dbg_check_znode()
1621 /* Iterate over all indexing nodes */ in dbg_walk_index()
2277 * o makes sure that all leaf nodes exist and their CRCs are correct;
2281 * The function reads whole indexing tree and all nodes, so it is pretty
2313 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2315 * @head: the list of nodes ('struc
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Ddebug.c697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (", in ubifs_dump_lprop()
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum, in ubifs_dump_leb()
854 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
1261 ubifs_err(c, "2 xent/dent nodes with the same name"); in dbg_check_key_order()
1305 /* Only dirty zbranch may have no on-flash nodes */ in dbg_check_znode()
1621 /* Iterate over all indexing nodes */ in dbg_walk_index()
2277 * o makes sure that all leaf nodes exist and their CRCs are correct;
2281 * The function reads whole indexing tree and all nodes, so it is pretty
2313 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2315 * @head: the list of nodes ('struc
[all...]
/kernel/linux/linux-6.6/tools/perf/
H A Dbuiltin-record.c3791 spec[s] = topo->nodes[s].cpus; in record__init_thread_numa_masks()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dextent_io.c3801 * btree nodes/leafs whose content on disk is invalid - either garbage in set_btree_ioerr()
4731 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]); in extent_fiemap()
H A Ddisk-io.c136 * Lock-nesting across peer nodes is always done with the immediate parent
4177 * and then a transaction commit runs the same delayed nodes in close_ctree()
4178 * before any delayed worker has done something with the nodes. in close_ctree()
4824 l = path->nodes[0]; in btrfs_find_highest_objectid()
/kernel/linux/linux-6.6/tools/testing/radix-tree/
H A Dmaple.c88 * check_new_node() - Check the creation of new nodes and error path
96 struct maple_node *nodes[100]; in check_new_node() local
103 /* Try allocating 3 nodes */ in check_new_node()
106 /* request 3 nodes to be allocated. */ in check_new_node()
146 /* Allocate 3 nodes, will fail. */ in check_new_node()
148 /* Drop the lock and allocate 3 nodes. */ in check_new_node()
257 nodes[j] = mas_pop_node(&mas); in check_new_node()
263 mas_push_node(&mas, nodes[j]); in check_new_node()
282 /* Drop the lock and allocate the nodes. */ in check_new_node()
[all...]

Completed in 50 milliseconds

1...<<1112131415161718