/linux-6.6.21/fs/reiserfs/ |
D | xattr.c | 190 struct dentry *dentries[8]; member 203 if (dbuf->count == ARRAY_SIZE(dbuf->dentries)) in fill_with_dentries() 225 dbuf->dentries[dbuf->count++] = dentry; in fill_with_dentries() 235 if (buf->dentries[i]) in cleanup_dentry_buf() 236 dput(buf->dentries[i]); in cleanup_dentry_buf() 275 for (i = 0; !err && i < buf.count && buf.dentries[i]; i++) { in reiserfs_for_each_xattr() 276 struct dentry *dentry = buf.dentries[i]; in reiserfs_for_each_xattr() 282 buf.dentries[i] = NULL; in reiserfs_for_each_xattr()
|
/linux-6.6.21/Documentation/filesystems/nfs/ |
D | exporting.rst | 11 dentries via open file descriptors or cwd/root. However remote 27 and dentries will be termed "exportable". 58 This is set when anonymous dentries are created, and cleared when a 69 subtree is successfully reconnected to root. Until then dentries 72 dentries. That guarantees that we won't need to hunt them down upon 80 c. Helper routines to allocate anonymous dentries, and to help attach 81 loose directory dentries at lookup time. They are:
|
/linux-6.6.21/drivers/infiniband/hw/mlx4/ |
D | sysfs.c | 269 port->dentr_ar->dentries[i].entry_num = i; in add_port_entries() 270 ret = create_sysfs_entry(port, &port->dentr_ar->dentries[i], in add_port_entries() 287 port->dentr_ar->dentries[attr.gid_tbl_len + i].entry_num = i; in add_port_entries() 289 &port->dentr_ar->dentries[attr.gid_tbl_len + i], in add_port_entries() 306 port->dentr_ar->dentries[2 * attr.gid_tbl_len + i].entry_num = i; in add_port_entries() 308 &port->dentr_ar->dentries[2 * attr.gid_tbl_len + i], in add_port_entries()
|
D | mlx4_ib.h | 572 struct mlx4_ib_iov_sysfs_attr dentries[3 * NUM_ALIAS_GUID_PER_PORT + 1]; member
|
/linux-6.6.21/Documentation/admin-guide/sysctl/ |
D | fs.rst | 53 int nr_negative; /* # of unused negative dentries */ 59 ``nr_dentry`` shows the total number of dentries allocated (active 60 + unused). ``nr_unused shows`` the number of dentries that are not 68 ``nr_negative`` shows the number of unused dentries that are also 69 negative dentries which do not map to any files. Instead,
|
D | vm.rst | 231 reclaimable slab objects like dentries and inodes. Once dropped, their 238 To free reclaimable slab objects (includes dentries and inodes):: 253 (inodes, dentries, pagecache, etc...) These objects are automatically 958 reclaim dentries and inodes at a "fair" rate with respect to pagecache and 961 never reclaim dentries and inodes due to memory pressure and this can easily 963 causes the kernel to prefer to reclaim dentries and inodes.
|
/linux-6.6.21/fs/ |
D | super.c | 191 long dentries; in super_cache_scan() local 210 dentries = list_lru_shrink_count(&sb->s_dentry_lru, sc); in super_cache_scan() 211 total_objects = dentries + inodes + fs_objects + 1; in super_cache_scan() 216 dentries = mult_frac(sc->nr_to_scan, dentries, total_objects); in super_cache_scan() 227 sc->nr_to_scan = dentries + 1; in super_cache_scan()
|
/linux-6.6.21/Documentation/filesystems/ |
D | path-lookup.txt | 19 as many cached path component dentries as possible. This significantly 36 even stores into cachelines of common dentries). This is known as "rcu-walk" 108 expensive and also problematic for directory dentries. Latency would be far to 116 the remaining dentries on the list. 183 reference counts on intermediate dentries along the path. To do this, a per
|
D | vfs.rst | 37 most computers cannot fit all dentries in the RAM at the same time, some 39 dentry, the VFS may have to resort to creating dentries along the way, 52 dentries (hard links, for example, do this). 657 negative or needs lookup. Cached positive dentries are still 1274 dentries in the dcache are valid. Network filesystems are 1328 However, our vfsmount is pinned, and RCU held, so the dentries 1359 filesystems probably dont want to use it, because their dentries 1423 one of the underlying dentries hidden by the overlay. It is 1434 of child dentries. Child dentries are basically like files in a 1442 manipulate dentries: [all …]
|
D | ramfs-rootfs-initramfs.rst | 28 dentries and page cache as usual, but there's nowhere to write them to. 46 as creating and destroying dentries. Plus it needed a filesystem driver
|
D | ceph.rst | 43 directories, allowing entire directories of dentries and inodes to be
|
D | path-lookup.rst | 115 dentry of a directory to the dentries of the children, that linkage is 260 ``d_lock`` on one or more the dentries while the change happens. One 261 exception is when idle dentries are removed from the dcache due to 281 not prevent them both adding new dentries with the same name. As this 538 The Linux VFS has a concept of "managed" dentries. There are three 539 potentially interesting things about these dentries corresponding 680 data structures - dentries, inodes, super_blocks, and mounts - will
|
D | f2fs.rst | 150 dentries is limited to ~3.4k. 647 dentries(11 * 214 bytes) + file name (8 * 214 bytes) 657 | bitmap | reserved | dentries | file names |
|
D | porting.rst | 365 unreferenced dentries, and is now only called when the dentry refcount goes to 412 atomic operations and scalability hazards on dentries and inodes (see
|
D | orangefs.rst | 541 dentries is to always obtain the needed information from userspace - at
|
D | idmappings.rst | 618 They allow to expose the same set of dentries with different ownership at
|
D | fscrypt.rst | 38 unencrypted files. Similarly, half as many dentries and inodes are
|
/linux-6.6.21/fs/ceph/ |
D | inode.c | 1846 ctl->dentries = kmap(ctl->page); in fill_readdir_cache() 1848 memset(ctl->dentries, 0, PAGE_SIZE); in fill_readdir_cache() 1854 ctl->dentries[idx] = dn; in fill_readdir_cache()
|
D | dir.c | 151 cache_ctl->dentries = kmap(cache_ctl->page); in __dcache_find_get_entry() 161 dentry = cache_ctl->dentries[cache_ctl->index]; in __dcache_find_get_entry()
|
D | super.h | 900 struct dentry **dentries; member
|
/linux-6.6.21/fs/nfsd/ |
D | nfs4state.c | 2910 struct dentry *dentries[ARRAY_SIZE(client_files)]; in create_client() local 2933 client_files, dentries); in create_client() 2934 clp->cl_nfsd_info_dentry = dentries[0]; in create_client()
|
/linux-6.6.21/Documentation/admin-guide/cgroup-v1/ |
D | cpusets.rst | 333 such as for inodes and dentries evenly over all the nodes that the
|
/linux-6.6.21/Documentation/admin-guide/ |
D | cgroup-v2.rst | 1142 - Kernel data structures such as dentries and inodes. 1446 dentries and inodes.
|