| /linux/security/apparmor/include/ |
| H A D | perms.h | 73 u32 subtree; /* allow perm on full subtree only when allow is set */ member
119 accum->subtree |= addend->subtree & ~addend->deny; in aa_perms_accum_raw()
146 accum->subtree &= addend->subtree & ~accum->deny; in aa_perms_accum()
|
| /linux/lib/ |
| H A D | rbtree_test.c | 226 u32 subtree, max = node->val; in check_augmented() local
228 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
230 if (max < subtree) in check_augmented()
231 max = subtree; in check_augmented()
234 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
236 if (max < subtree) in check_augmented()
237 max = subtree; in check_augmented()
|
| /linux/Documentation/core-api/ |
| H A D | rbtree.rst | 234 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.
|
| H A D | assoc_array.rst | 441 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/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 273 * subtree and duplicates the bit settings to the newly allocated nodes.
274 * Returns the newly allocated copy of subtree.
276 static struct node *node_copy_subtree(const struct node *subtree) in node_copy_subtree() argument
280 /* Duplicate the node at the root of the subtree */ in node_copy_subtree()
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 in node_copy_subtree()
[all...] |
| /linux/net/ipv6/ |
| H A D | ip6_fib.c | 68 * affected subtree. This allows for cached routes to be asynchronously
1456 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1460 * Create subtree. in fib6_add()
1464 * sfn[subtree root] in fib6_add()
1469 /* Create subtree root node */ in fib6_add()
1479 /* Now add the first leaf node to new subtree */ in fib6_add()
1496 /* Now link new subtree to main tree */ in fib6_add()
1498 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1582 * route to it in both subtree creation failure and fib6_add_rt2node() in fib6_add()
1636 struct fib6_node *subtree in fib6_node_lookup_1() local
1779 struct fib6_node *subtree = FIB6_SUBTREE(fn); fib6_locate() local
[all...] |
| /linux/Documentation/filesystems/ |
| H A D | propagate_umount.txt | 27 extend that set. The original set is a full subtree and its root is
110 subtree mounted strictly inside m and containing mounts that do not
123 that do not belong to S, any subtree that fits into S will fit into
363 in S - {x} and a subtree mounted strictly inside m, such that m contains
365 that subtree must belong to S. But that means that this subtree must
366 contain x somewhere *and* that parent of x either belongs that subtree
|
| H A D | sharedsubtree.rst | 24 that got mounted recently. Shared subtree semantics provide the necessary
33 Shared subtree provides four different flavors of mounts; struct vfsmount to be
442 then the subtree under the unbindable mount is pruned in the new
685 Q2. Why can't the shared subtree be implemented using exportfs?
688 shared subtree can do. I cannot imagine a way to implement the
694 locations within the same subtree.
696 if one rbind mounts a tree within the same subtree 'n' times
|
| H A D | vfs.rst | 202 ->mount() may choose to return a subtree of existing filesystem - it
1418 the daemon go past and construct the subtree there. 0 should be
|
| H A D | path-lookup.rst | 432 escape that subtree. It works a bit like a local ``chroot()``.
|
| /linux/Documentation/sound/designs/ |
| H A D | procfile.rst | 14 Each card has its subtree cardX, where X is from 0 to 7. The
70 this subtree is described later.
|
| /linux/scripts/dtc/ |
| H A D | dtx_diff | 44 If DTx is a directory, it is treated as a DT subtree, such as
|
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 280 * Some nodes in left subtree satisfy Cond2.
|
| /linux/security/apparmor/ |
| H A D | policy_unpack.c | 658 aa_unpack_u32(e, &perm->subtree, NULL) && in unpack_perm()
1229 if (perm->subtree & ~perm->allow) in verify_perm()
|
| /linux/Documentation/firmware-guide/acpi/ |
| H A D | namespace.rst | 198 sysfs as directories in the subtree under /sys/devices/LNXSYSTM:00. The
|
| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | blkio-controller.rst | 70 to the whole subtree while all statistics are local to the IOs
|
| /linux/fs/ |
| H A D | namespace.c | 2404 * specified subtree. Such references can act as pins for mount namespaces
2408 static bool check_for_nsfs_mounts(struct mount *subtree) in check_for_nsfs_mounts() argument
2414 for (p = subtree; p; p = next_mnt(p, subtree)) in check_for_nsfs_mounts()
4524 * a mount subtree.
|
| /linux/Documentation/RCU/Design/Memory-Ordering/ |
| H A D | Tree-RCU-Memory-Ordering.rst | 468 subtree headed by that ``rcu_node`` structure. A key point is that if a
|
| /linux/Documentation/driver-api/ |
| H A D | vfio.rst | 493 subtree that can be treated as a unit for the purposes of partitioning and
|
| /linux/Documentation/networking/ |
| H A D | can.rst | 1497 - Andrey Volkov (kernel subtree structure, ioctls, MSCAN driver)
|