/linux-master/fs/bcachefs/ |
H A D | subvolume.c | 130 snapshot_tree = snapshot_t(c, snapshot_root)->tree; 136 "%s: snapshot tree %u not found", __func__, snapshot_tree); 382 * Separate from the snapshot tree in the snapshots btree, we record the tree 624 root_snapshot.v.tree = cpu_to_le32(1);
|
/linux-master/kernel/ |
H A D | auditsc.c | 310 static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree) argument 315 if (!tree) 320 if (audit_tree_match(p->c[n], tree)) 326 if (audit_tree_match(p->c[n], tree)) 643 result = match_tree_refs(ctx, rule->tree); 2105 pr_warn("out of memory, audit has lost a tree reference\n"); 2164 pr_warn("out of memory, audit has lost a tree reference\n");
|
/linux-master/scripts/ |
H A D | checkpatch.pl | 29 my $tree = 1; 89 --no-tree run without a kernel tree 116 --root=PATH PATH to the kernel tree root 296 'tree!' => \$tree, 445 if ($tree) { 448 die "$P: $root: --root does not point at a valid tree\n"; 460 print "Must be run from the top-level dir. of a kernel tree\n"; 1139 return 0 if (!$tree || !( [all...] |
H A D | get_feat.pl | 617 When used with B<rest> command, it will use either one of the tree formats:
|
/linux-master/include/linux/ |
H A D | audit.h | 54 struct audit_tree *tree; /* associated watched tree */ member in struct:audit_krule 56 struct list_head rlist; /* entry in audit_{watch,tree}.rules list */
|
H A D | mm_types.h | 548 * conditions. These are held in a global tree and are pinned by the VMAs that 552 struct rb_node vm_rb; /* link in global region tree */ 649 /* The first cache line has the info for VMA tree walking. */ 675 /* Flag to indicate areas detached from the mm->mm_mt tree */ 698 * linkage into the address_space->i_mmap interval tree. 707 * A file's MAP_PRIVATE vma can be in both i_mmap tree and anon_vma 709 * can only be in the i_mmap tree. An anonymous MAP_PRIVATE, stack 1101 .tree = &(__mm)->mm_mt, \
|
/linux-master/fs/btrfs/ |
H A D | fs.h | 21 #include <linux/radix-tree.h> 29 #include "extent-io-tree.h" 104 /* Indicates there was an error cleaning up a log tree. */ 151 /* Indicate that we can't trust the free space tree for caching yet */ 154 /* Indicate whether there are any tree modification log users */ 179 * Indicate that we have found a tree block which is only aligned to 265 * Features under developmen like Extent tree v2 support is enabled 417 /* The log root tree is a directory of all the other log roots */ 420 /* The tree that holds the global roots (csum, extent, etc) */ 442 * Block reservation for extent, checksum, root tree an [all...] |
H A D | tree-log.c | 13 #include "tree-log.h" 24 #include "extent-tree.h" 25 #include "root-tree.h" 30 #include "tree-checker.h" 84 * directory tree. The inode link count fixup code takes care of the 89 * stages for the tree walking. The first 119 * tree logging is a special write ahead log used to make sure that 120 * fsyncs and O_SYNCs can happen without doing full tree commits. 122 * Full tree commits are expensive because they require commonly 124 * extent tree a 4905 struct extent_map_tree *tree = &inode->extent_tree; local [all...] |
/linux-master/drivers/gpu/drm/amd/amdgpu/ |
H A D | amdgpu_ras.h | 30 #include <linux/radix-tree.h>
|
/linux-master/drivers/nvme/target/ |
H A D | nvmet.h | 21 #include <linux/radix-tree.h>
|
/linux-master/fs/xfs/ |
H A D | xfs_qm.c | 44 * currently is the only interface into the radix tree code that allows 59 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); local 76 nr_found = radix_tree_gang_lookup(tree, (void **)batch,
|
/linux-master/fs/ |
H A D | namespace.c | 99 * up the tree. 102 * tree or hash is modified or when a vfsmount structure is modified. 1498 * may_umount_tree - check if a mount tree is busy 1499 * @m: root of mount tree 1501 * This is called to check if a tree of mounts has any 2038 struct mount *tree; local 2041 tree = ERR_PTR(-EINVAL); 2043 tree = copy_tree(real_mount(path->mnt), path->dentry, 2046 if (IS_ERR(tree)) 2047 return ERR_CAST(tree); [all...] |
/linux-master/kernel/events/ |
H A D | core.c | 1556 groups->tree = RB_ROOT; 1668 * Insert @event into @groups' tree; using 1678 rb_add(&event->group_node, &groups->tree, __group_less); 1694 * Delete a group from a tree. 1701 RB_EMPTY_ROOT(&groups->tree)); 1703 rb_erase(&event->group_node, &groups->tree); 1733 node = rb_find_first(&key, &groups->tree, __group_cmp); 1762 * Iterate through the whole groups tree. 1765 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \ 3981 if (!RB_EMPTY_ROOT(&ctx->pinned_groups.tree)) { 4238 struct rb_root *tree; local [all...] |
/linux-master/fs/smb/client/ |
H A D | connect.c | 227 * setup and tree connect requests, but it is better than not doing 228 * a tree connect when needed, and all following requests failing 1917 * new tree connection for the IPC (interprocess communication RPC) 2040 * tcons of the session. No need to send a tree disconnect here. 3694 const char *tree, struct cifs_tcon *tcon, 3744 cifs_strtoUTF16((__le16 *) bcc_ptr, tree, 3750 strcpy(bcc_ptr, tree); 3751 bcc_ptr += strlen(tree) + 1; 3793 strscpy(tcon->tree_name, tree, sizeof(tcon->tree_name)); 4139 /* insert a tcon_link into the tree */ 3693 CIFSTCon(const unsigned int xid, struct cifs_ses *ses, const char *tree, struct cifs_tcon *tcon, const struct nls_table *nls_codepage) argument [all...] |
/linux-master/arch/x86/crypto/ |
H A D | sha256-ssse3-asm.S | 14 # COPYING in the main directory of this source tree, or the
|
H A D | sha256-avx-asm.S | 14 # COPYING in the main directory of this source tree, or the
|
H A D | sha512-avx-asm.S | 15 # COPYING in the main directory of this source tree, or the
|
H A D | sha512-ssse3-asm.S | 15 # COPYING in the main directory of this source tree, or the
|
/linux-master/lib/ |
H A D | radix-tree.c | 24 #include <linux/radix-tree.h> 30 #include "radix-tree.h" 33 * Radix tree node cache. 38 * The radix tree is variable-height, so an insert operation not only has 43 * The worst case is a zero height tree with just a single item at index 0, 51 * The IDR does not have to be as high as the radix tree since it uses 209 * The maximum index which can be stored in a radix tree 315 * ensure that the addition of a single element in the tree cannot fail. On 319 * To make use of this facility, the radix tree must be initialised without 358 * ensure that the addition of a single element in the tree canno [all...] |
/linux-master/include/net/sctp/ |
H A D | structs.h | 36 #include <linux/generic-radix-tree.h>
|
/linux-master/tools/testing/selftests/drivers/net/netdevsim/ |
H A D | udp_tunnel_nic.sh | 218 tree $NSIM_DEV_DFS/
|
/linux-master/drivers/gpu/drm/i915/ |
H A D | i915_gem.c | 898 rb_erase(&vma->obj_node, &obj->vma.tree); 1199 * rb-tree form, lowering the amount of code that has to deal with
|
/linux-master/fs/ocfs2/ |
H A D | dlmglue.c | 4154 struct ocfs2_refcount_tree *tree = local 4157 return ocfs2_ci_checkpointed(&tree->rf_ci, lockres, new_level); 4163 struct ocfs2_refcount_tree *tree = local 4166 ocfs2_metadata_cache_purge(&tree->rf_ci);
|
/linux-master/fs/hfsplus/ |
H A D | xattr.c | 151 * B-tree of CatalogFile. This method locks mutex of 152 * CatalogFile's B-tree. As a result, if some thread 155 * CatalogFile's B-tree's mutex. However, if code will 721 if (key_len == 0 || key_len > fd.tree->max_key_len) {
|
/linux-master/drivers/pinctrl/ |
H A D | pinmux.c | 23 #include <linux/radix-tree.h>
|