Home
last modified time | relevance | path

Searched refs:nodep (Results 1 – 7 of 7) sorted by relevance

/linux-6.15/tools/testing/selftests/kvm/lib/
H A Dsparsebit.c209 for (nodep = s->root; nodep && nodep->left; nodep = nodep->left) in node_first()
228 for (nodep = nodep->right; nodep->left; nodep = nodep->left) in node_next()
238 nodep = nodep->parent; in node_next()
256 for (nodep = nodep->left; nodep->right; nodep = nodep->right) in node_prev()
266 nodep = nodep->parent; in node_prev()
316 nodep = nodep->idx > idx ? nodep->left : nodep->right) { in node_find()
784 nodep = nodep->idx > idx ? nodep->left : nodep->right) in sparsebit_is_set()
887 nodep->parent, nodep->left, nodep->right); in dump_nodes()
1600 for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) { in sparsebit_dump()
1831 nodep, nodep->idx, nodep->num_after, in sparsebit_validate_internal()
[all …]
/linux-6.15/lib/
H A Dradix-tree.c86 struct radix_tree_node **nodep, unsigned long index) in radix_tree_descend() argument
91 *nodep = (void *)entry; in radix_tree_descend()
389 struct radix_tree_node **nodep, unsigned long *maxindex) in radix_tree_load_root() argument
393 *nodep = node; in radix_tree_load_root()
599 unsigned long index, struct radix_tree_node **nodep, in __radix_tree_create() argument
640 if (nodep) in __radix_tree_create()
641 *nodep = node; in __radix_tree_create()
748 unsigned long index, struct radix_tree_node **nodep, in __radix_tree_lookup() argument
774 if (nodep) in __radix_tree_lookup()
775 *nodep = parent; in __radix_tree_lookup()
/linux-6.15/fs/xfs/libxfs/
H A Dxfs_iext_tree.c459 struct xfs_iext_node **nodep, in xfs_iext_split_node() argument
463 struct xfs_iext_node *node = *nodep; in xfs_iext_split_node()
471 *nodep = new; in xfs_iext_split_node()
487 *nodep = new; in xfs_iext_split_node()
/linux-6.15/include/linux/
H A Dradix-tree.h222 struct radix_tree_node **nodep, void __rcu ***slotp);
/linux-6.15/arch/powerpc/kernel/
H A Dprom_init.c642 static int __init prom_next_node(phandle *nodep) in prom_next_node() argument
646 if ((node = *nodep) != 0 in prom_next_node()
647 && (*nodep = call_prom("child", 1, 1, node)) != 0) in prom_next_node()
649 if ((*nodep = call_prom("peer", 1, 1, node)) != 0) in prom_next_node()
654 if ((*nodep = call_prom("peer", 1, 1, node)) != 0) in prom_next_node()
/linux-6.15/kernel/
H A Dsys.c2831 SYSCALL_DEFINE3(getcpu, unsigned __user *, cpup, unsigned __user *, nodep, in SYSCALL_DEFINE3() argument
2839 if (nodep) in SYSCALL_DEFINE3()
2840 err |= put_user(cpu_to_node(cpu), nodep); in SYSCALL_DEFINE3()
/linux-6.15/security/selinux/ss/
H A Dpolicydb.c1222 static int read_cons_helper(struct policydb *p, struct constraint_node **nodep, in read_cons_helper() argument
1240 *nodep = c; in read_cons_helper()