Home
last modified time | relevance | path

Searched refs:subtree (Results 1 – 21 of 21) sorted by relevance

/Linux-v6.1/lib/
Drbtree_test.c225 u32 subtree, max = node->val; in check_augmented() local
227 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
229 if (max < subtree) in check_augmented()
230 max = subtree; in check_augmented()
233 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
235 if (max < subtree) in check_augmented()
236 max = subtree; in check_augmented()
/Linux-v6.1/Documentation/filesystems/nfs/
Dexporting.rst69 subtree is successfully reconnected to root. Until then dentries
70 in such subtree are retained only as long as there are references;
194 EXPORT_OP_NOSUBTREECHK - disallow subtree checking on this fs
200 inode to ensure that it's within an exported subtree. This is an
202 This flag exempts the filesystem from subtree checking and causes
203 exportfs to get back an error if it tries to enable subtree checking
/Linux-v6.1/Documentation/core-api/
Drbtree.rst234 the contents of all nodes in the subtree rooted at N. This data can
267 - A copy callback, which copies the augmented value for a given subtree
268 to a newly assigned subtree root.
271 subtree to a newly assigned subtree root AND recomputes the augmented
272 information for the former subtree root.
318 * Some nodes in left subtree satisfy Cond2.
Dassoc_array.rst441 the metadata key prefix must be in the subtree that the metadata pointer points
486 When the number of objects in the subtree rooted at a node falls to 16 or
487 fewer, then the subtree will be collapsed down to a single node - and this will
516 3. Insertion replacing part of a subtree that we haven't yet entered. This
517 may involve replacement of part of that subtree - but that won't affect
535 could see the new node. The entire collapsed subtree is thrown away
/Linux-v6.1/tools/testing/selftests/kvm/lib/
Dsparsebit.c276 static struct node *node_copy_subtree(struct node *subtree) in node_copy_subtree() argument
287 root->idx = subtree->idx; in node_copy_subtree()
288 root->mask = subtree->mask; in node_copy_subtree()
289 root->num_after = subtree->num_after; in node_copy_subtree()
292 if (subtree->left) { in node_copy_subtree()
293 root->left = node_copy_subtree(subtree->left); in node_copy_subtree()
297 if (subtree->right) { in node_copy_subtree()
298 root->right = node_copy_subtree(subtree->right); in node_copy_subtree()
/Linux-v6.1/net/ipv6/
Dip6_fib.c1409 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1451 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1580 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_node_lookup_1() local
1582 if (subtree || fn->fn_flags & RTN_RTINFO) { in fib6_node_lookup_1()
1593 if (subtree) { in fib6_node_lookup_1()
1595 sfn = fib6_node_lookup_1(subtree, in fib6_node_lookup_1()
1723 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_locate() local
1725 if (subtree) { in fib6_locate()
1726 fn = fib6_locate_1(subtree, saddr, src_len, in fib6_locate()
1850 RCU_INIT_POINTER(pn->subtree, NULL); in fib6_repair_tree()
/Linux-v6.1/include/net/
Dip6_fib.h78 struct fib6_node __rcu *subtree; member
122 #define FIB6_SUBTREE(fn) (rcu_dereference_protected((fn)->subtree, 1))
/Linux-v6.1/Documentation/sound/designs/
Dprocfile.rst14 Each card has its subtree cardX, where X is from 0 to 7. The
70 this subtree is described later.
/Linux-v6.1/Documentation/filesystems/
Dsharedsubtree.rst24 that got mounted recently. Shared subtree semantics provide the necessary
33 Shared subtree provides four different flavors of mounts; struct vfsmount to be
441 then the subtree under the unbindable mount is pruned in the new
682 Q2. Why can't the shared subtree be implemented using exportfs?
685 shared subtree can do. I cannot imagine a way to implement the
691 locations within the same subtree.
693 if one rbind mounts a tree within the same subtree 'n' times
Dvfs.rst179 ->mount() may choose to return a subtree of existing filesystem - it
1337 the daemon go past and construct the subtree there. 0 should be
Dpath-lookup.rst432 escape that subtree. It works a bit like a local ``chroot()``.
/Linux-v6.1/fs/ext4/
Dindirect.c1342 int subtree = 1; in ext4_ind_remove_space() local
1346 subtree = 0; in ext4_ind_remove_space()
1351 if (!subtree) { in ext4_ind_remove_space()
/Linux-v6.1/scripts/dtc/
Ddtx_diff44 If DTx is a directory, it is treated as a DT subtree, such as
/Linux-v6.1/Documentation/admin-guide/
Dcgroup-v2.rst198 behaviour without this option is to include subtree counts.
278 a subtree while still maintaining the common resource domain for them.
286 of a threaded subtree, that is, the nearest ancestor which is not
288 serves as the resource domain for the entire subtree.
290 Inside a threaded subtree, threads of a process can be put in
296 consumptions of the subtree, it is considered to have internal
304 domain, a domain which is serving as the domain of a threaded subtree,
346 subtree.
349 subtree, and, while the threads can be scattered across the subtree,
352 processes in the subtree and is not readable in the subtree proper.
[all …]
/Linux-v6.1/Documentation/translations/zh_CN/core-api/
Drbtree.rst280 * Some nodes in left subtree satisfy Cond2.
/Linux-v6.1/Documentation/firmware-guide/acpi/
Dnamespace.rst198 sysfs as directories in the subtree under /sys/devices/LNXSYSTM:00. The
/Linux-v6.1/Documentation/admin-guide/cgroup-v1/
Dblkio-controller.rst70 to the whole subtree while all statistics are local to the IOs
/Linux-v6.1/fs/
Dnamespace.c2734 static bool check_for_nsfs_mounts(struct mount *subtree) in check_for_nsfs_mounts() argument
2740 for (p = subtree; p; p = next_mnt(p, subtree)) in check_for_nsfs_mounts()
/Linux-v6.1/Documentation/driver-api/
Dvfio.rst322 subtree that can be treated as a unit for the purposes of partitioning and
/Linux-v6.1/Documentation/RCU/Design/Memory-Ordering/
DTree-RCU-Memory-Ordering.rst468 subtree headed by that ``rcu_node`` structure. A key point is that if a
/Linux-v6.1/Documentation/networking/
Dcan.rst1465 - Andrey Volkov (kernel subtree structure, ioctls, MSCAN driver)