blob: 94acbde17bb190e3299c35e92ad96525f575812b [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002#ifndef __LINUX_DCACHE_H
3#define __LINUX_DCACHE_H
4
Arun Sharma600634972011-07-26 16:09:06 -07005#include <linux/atomic.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07006#include <linux/list.h>
Franck Bui-Huu82524742008-05-12 21:21:05 +02007#include <linux/rculist.h>
Nick Pigginceb5bdc2011-01-07 17:50:05 +11008#include <linux/rculist_bl.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07009#include <linux/spinlock.h>
Nick Piggin31e6b012011-01-07 17:49:52 +110010#include <linux/seqlock.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#include <linux/cache.h>
12#include <linux/rcupdate.h>
Waiman Long98474232013-08-28 18:24:59 -070013#include <linux/lockref.h>
George Spelvinf4bcbe72016-05-20 07:26:00 -040014#include <linux/stringhash.h>
Ingo Molnarf9411eb2017-02-06 09:50:49 +010015#include <linux/wait.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016
Jan Blunckcf28b482008-02-14 19:38:44 -080017struct path;
Linus Torvalds1da177e2005-04-16 15:20:36 -070018struct vfsmount;
19
20/*
21 * linux/include/linux/dcache.h
22 *
23 * Dirent cache data structures
24 *
25 * (C) Copyright 1997 Thomas Schoebel-Theuer,
26 * with heavy changes by Linus Torvalds
27 */
28
29#define IS_ROOT(x) ((x) == (x)->d_parent)
30
Linus Torvalds26fe5752012-05-10 13:14:12 -070031/* The hash is always the low bits of hash_len */
32#ifdef __LITTLE_ENDIAN
Andrew Morton2bd03e42016-01-14 15:17:53 -080033 #define HASH_LEN_DECLARE u32 hash; u32 len
Will Deacona5c21dc2013-12-12 17:40:21 +000034 #define bytemask_from_count(cnt) (~(~0ul << (cnt)*8))
Linus Torvalds26fe5752012-05-10 13:14:12 -070035#else
Andrew Morton2bd03e42016-01-14 15:17:53 -080036 #define HASH_LEN_DECLARE u32 len; u32 hash
Will Deacona5c21dc2013-12-12 17:40:21 +000037 #define bytemask_from_count(cnt) (~(~0ul >> (cnt)*8))
Linus Torvalds26fe5752012-05-10 13:14:12 -070038#endif
39
Linus Torvalds1da177e2005-04-16 15:20:36 -070040/*
41 * "quick string" -- eases parameter passing, but more importantly
42 * saves "metadata" about the string (ie length and the hash).
43 *
44 * hash comes first so it snuggles against d_parent in the
45 * dentry.
46 */
47struct qstr {
Linus Torvalds26fe5752012-05-10 13:14:12 -070048 union {
49 struct {
50 HASH_LEN_DECLARE;
51 };
52 u64 hash_len;
53 };
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 const unsigned char *name;
55};
56
Linus Torvalds26fe5752012-05-10 13:14:12 -070057#define QSTR_INIT(n,l) { { { .len = l } }, .name = n }
Linus Torvalds26fe5752012-05-10 13:14:12 -070058
David Howellscdf01222017-07-04 17:25:22 +010059extern const struct qstr empty_name;
David Howellscdf01222017-07-04 17:25:22 +010060extern const struct qstr slash_name;
61
Linus Torvalds1da177e2005-04-16 15:20:36 -070062struct dentry_stat_t {
Glauber Costa3942c072013-08-28 10:17:53 +100063 long nr_dentry;
64 long nr_unused;
65 long age_limit; /* age in seconds */
66 long want_pages; /* pages requested by system */
67 long dummy[2];
Linus Torvalds1da177e2005-04-16 15:20:36 -070068};
69extern struct dentry_stat_t dentry_stat;
70
Nick Pigginc2452f32008-12-01 09:33:43 +010071/*
72 * Try to keep struct dentry aligned on 64 byte cachelines (this will
73 * give reasonable cacheline footprint with larger lines without the
74 * large memory footprint increase).
75 */
76#ifdef CONFIG_64BIT
Nick Piggin44a7d7a2011-01-07 17:49:56 +110077# define DNAME_INLINE_LEN 32 /* 192 bytes */
Nick Pigginc2452f32008-12-01 09:33:43 +010078#else
Nick Piggin44a7d7a2011-01-07 17:49:56 +110079# ifdef CONFIG_SMP
80# define DNAME_INLINE_LEN 36 /* 128 bytes */
81# else
82# define DNAME_INLINE_LEN 40 /* 128 bytes */
83# endif
Nick Pigginc2452f32008-12-01 09:33:43 +010084#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070085
Waiman Long98474232013-08-28 18:24:59 -070086#define d_lock d_lockref.lock
87
Linus Torvalds1da177e2005-04-16 15:20:36 -070088struct dentry {
Nick Piggin44a7d7a2011-01-07 17:49:56 +110089 /* RCU lookup touched fields */
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 unsigned int d_flags; /* protected by d_lock */
Nick Piggin31e6b012011-01-07 17:49:52 +110091 seqcount_t d_seq; /* per dentry seqlock */
Nick Pigginceb5bdc2011-01-07 17:50:05 +110092 struct hlist_bl_node d_hash; /* lookup hash list */
Linus Torvalds1da177e2005-04-16 15:20:36 -070093 struct dentry *d_parent; /* parent directory */
94 struct qstr d_name;
Nick Piggin44a7d7a2011-01-07 17:49:56 +110095 struct inode *d_inode; /* Where the name belongs to - NULL is
96 * negative */
97 unsigned char d_iname[DNAME_INLINE_LEN]; /* small names */
98
99 /* Ref lookup also touches following */
Waiman Long98474232013-08-28 18:24:59 -0700100 struct lockref d_lockref; /* per-dentry lock and refcount */
Nick Piggin44a7d7a2011-01-07 17:49:56 +1100101 const struct dentry_operations *d_op;
102 struct super_block *d_sb; /* The root of the dentry tree */
103 unsigned long d_time; /* used by d_revalidate */
104 void *d_fsdata; /* fs-specific data */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
Al Virod9171b92016-04-15 03:33:13 -0400106 union {
107 struct list_head d_lru; /* LRU list */
108 wait_queue_head_t *d_wait; /* in-lookup ones only */
109 };
Al Viro946e51f2014-10-26 19:19:16 -0400110 struct list_head d_child; /* child of parent list */
111 struct list_head d_subdirs; /* our children */
Eric Dumazet5160ee62006-01-08 01:03:32 -0800112 /*
Al Viro946e51f2014-10-26 19:19:16 -0400113 * d_alias and d_rcu can share memory
Eric Dumazet5160ee62006-01-08 01:03:32 -0800114 */
115 union {
Al Viro946e51f2014-10-26 19:19:16 -0400116 struct hlist_node d_alias; /* inode alias list */
Al Viro94bdd652016-04-15 02:42:04 -0400117 struct hlist_bl_node d_in_lookup_hash; /* only for in-lookup ones */
Eric Dumazet5160ee62006-01-08 01:03:32 -0800118 struct rcu_head d_rcu;
119 } d_u;
Kees Cook3859a272016-10-28 01:22:25 -0700120} __randomize_layout;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121
Ingo Molnara90b9c02006-07-03 00:25:04 -0700122/*
123 * dentry->d_lock spinlock nesting subclasses:
124 *
125 * 0: normal
126 * 1: nested
127 */
128enum dentry_d_lock_class
129{
130 DENTRY_D_LOCK_NORMAL, /* implicitly used by plain spin_lock() APIs. */
131 DENTRY_D_LOCK_NESTED
132};
133
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134struct dentry_operations {
Al Viro0b728e12012-06-10 16:03:43 -0400135 int (*d_revalidate)(struct dentry *, unsigned int);
Jeff Laytonecf3d1f2013-02-20 11:19:05 -0500136 int (*d_weak_revalidate)(struct dentry *, unsigned int);
Linus Torvaldsda53be12013-05-21 15:22:44 -0700137 int (*d_hash)(const struct dentry *, struct qstr *);
Al Viro6fa67e72016-07-31 16:37:25 -0400138 int (*d_compare)(const struct dentry *,
Nick Piggin621e1552011-01-07 17:49:27 +1100139 unsigned int, const char *, const struct qstr *);
Nick Pigginfe15ce42011-01-07 17:49:23 +1100140 int (*d_delete)(const struct dentry *);
Miklos Szeredi285b1022016-06-28 11:47:32 +0200141 int (*d_init)(struct dentry *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 void (*d_release)(struct dentry *);
Sage Weilf0023bc2011-10-28 10:02:42 -0700143 void (*d_prune)(struct dentry *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144 void (*d_iput)(struct dentry *, struct inode *);
Eric Dumazetc23fbb62007-05-08 00:26:18 -0700145 char *(*d_dname)(struct dentry *, char *, int);
David Howells9875cf82011-01-14 18:45:21 +0000146 struct vfsmount *(*d_automount)(struct path *);
Ian Kentfb5f51c2016-11-24 08:03:41 +1100147 int (*d_manage)(const struct path *, bool);
Miklos Szeredie698b8a2016-06-30 08:53:27 +0200148 struct dentry *(*d_real)(struct dentry *, const struct inode *,
Miklos Szeredi495e6422017-09-04 21:42:22 +0200149 unsigned int, unsigned int);
Nick Piggin44a7d7a2011-01-07 17:49:56 +1100150} ____cacheline_aligned;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
Nick Piggin5eef7fa2011-01-07 17:49:22 +1100152/*
153 * Locking rules for dentry_operations callbacks are to be found in
154 * Documentation/filesystems/Locking. Keep it updated!
155 *
Nick Piggin621e1552011-01-07 17:49:27 +1100156 * FUrther descriptions are found in Documentation/filesystems/vfs.txt.
157 * Keep it updated too!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 */
159
160/* d_flags entries */
David Howellsb18825a2013-09-12 19:22:53 +0100161#define DCACHE_OP_HASH 0x00000001
162#define DCACHE_OP_COMPARE 0x00000002
163#define DCACHE_OP_REVALIDATE 0x00000004
164#define DCACHE_OP_DELETE 0x00000008
165#define DCACHE_OP_PRUNE 0x00000010
Nick Piggin5f57cbc2011-01-07 17:49:54 +1100166
David Howellsb18825a2013-09-12 19:22:53 +0100167#define DCACHE_DISCONNECTED 0x00000020
Nick Piggin5f57cbc2011-01-07 17:49:54 +1100168 /* This dentry is possibly not currently connected to the dcache tree, in
169 * which case its parent will either be itself, or will have this flag as
170 * well. nfsd will not use a dentry with this bit set, but will first
171 * endeavour to clear the bit either by discovering that it is connected,
172 * or by performing lookup operations. Any filesystem which supports
173 * nfsd_operations MUST have a lookup function which, if it finds a
174 * directory inode with a DCACHE_DISCONNECTED dentry, will d_move that
175 * dentry into place and return that dentry rather than the passed one,
176 * typically using d_splice_alias. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177
David Howellsb18825a2013-09-12 19:22:53 +0100178#define DCACHE_REFERENCED 0x00000040 /* Recently used, don't discard. */
179#define DCACHE_RCUACCESS 0x00000080 /* Entry has ever been RCU-visible */
Eric Parisc28f7e52009-05-21 17:01:29 -0400180
David Howellsb18825a2013-09-12 19:22:53 +0100181#define DCACHE_CANT_MOUNT 0x00000100
182#define DCACHE_GENOCIDE 0x00000200
183#define DCACHE_SHRINK_LIST 0x00000400
Nick Piggin5f57cbc2011-01-07 17:49:54 +1100184
David Howellsb18825a2013-09-12 19:22:53 +0100185#define DCACHE_OP_WEAK_REVALIDATE 0x00000800
Jeff Laytonecf3d1f2013-02-20 11:19:05 -0500186
David Howellsb18825a2013-09-12 19:22:53 +0100187#define DCACHE_NFSFS_RENAMED 0x00001000
Linus Torvalds830c0f02011-08-06 22:41:50 -0700188 /* this dentry has been "silly renamed" and has to be deleted on the last
189 * dput() */
David Howellsb18825a2013-09-12 19:22:53 +0100190#define DCACHE_COOKIE 0x00002000 /* For use by dcookie subsystem */
191#define DCACHE_FSNOTIFY_PARENT_WATCHED 0x00004000
Linus Torvalds830c0f02011-08-06 22:41:50 -0700192 /* Parent inode is watched by some fsnotify listener */
Nick Pigginfb045ad2011-01-07 17:49:55 +1100193
David Howellsb18825a2013-09-12 19:22:53 +0100194#define DCACHE_DENTRY_KILLED 0x00008000
195
196#define DCACHE_MOUNTED 0x00010000 /* is a mountpoint */
197#define DCACHE_NEED_AUTOMOUNT 0x00020000 /* handle automount on this dir */
198#define DCACHE_MANAGE_TRANSIT 0x00040000 /* manage transit from this dirent */
David Howells9875cf82011-01-14 18:45:21 +0000199#define DCACHE_MANAGED_DENTRY \
David Howellscc53ce52011-01-14 18:45:26 +0000200 (DCACHE_MOUNTED|DCACHE_NEED_AUTOMOUNT|DCACHE_MANAGE_TRANSIT)
David Howells9875cf82011-01-14 18:45:21 +0000201
David Howellsb18825a2013-09-12 19:22:53 +0100202#define DCACHE_LRU_LIST 0x00080000
203
204#define DCACHE_ENTRY_TYPE 0x00700000
David Howellse7f7d222015-01-29 12:02:27 +0000205#define DCACHE_MISS_TYPE 0x00000000 /* Negative dentry (maybe fallthru to nowhere) */
206#define DCACHE_WHITEOUT_TYPE 0x00100000 /* Whiteout dentry (stop pathwalk) */
207#define DCACHE_DIRECTORY_TYPE 0x00200000 /* Normal directory */
208#define DCACHE_AUTODIR_TYPE 0x00300000 /* Lookupless directory (presumed automount) */
David Howells44bdb5e2015-01-29 12:02:29 +0000209#define DCACHE_REGULAR_TYPE 0x00400000 /* Regular file type (or fallthru to such) */
210#define DCACHE_SPECIAL_TYPE 0x00500000 /* Other file type (or fallthru to such) */
211#define DCACHE_SYMLINK_TYPE 0x00600000 /* Symlink (or fallthru to such) */
Miklos Szeredib161dfa62012-09-17 22:31:38 +0200212
Al Viro41edf272014-05-01 10:30:00 -0400213#define DCACHE_MAY_FREE 0x00800000
David Howellsdf1a0852015-01-29 12:02:28 +0000214#define DCACHE_FALLTHRU 0x01000000 /* Fall through to lower layer */
Miklos Szeredi2d902672016-06-30 08:53:27 +0200215#define DCACHE_ENCRYPTED_WITH_KEY 0x02000000 /* dir is encrypted with a valid key */
216#define DCACHE_OP_REAL 0x04000000
Jaegeuk Kim0b81d072015-05-15 16:26:10 -0700217
Al Viro85c7f812016-04-14 19:52:13 -0400218#define DCACHE_PAR_LOOKUP 0x10000000 /* being looked up (with parent locked shared) */
Al Viroba65dc52016-06-10 11:32:47 -0400219#define DCACHE_DENTRY_CURSOR 0x20000000
Al Viro85c7f812016-04-14 19:52:13 -0400220
Al Viro74c3cbe2007-07-22 08:04:18 -0400221extern seqlock_t rename_lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223/*
224 * These are the low-level FS interfaces to the dcache..
225 */
226extern void d_instantiate(struct dentry *, struct inode *);
227extern struct dentry * d_instantiate_unique(struct dentry *, struct inode *);
Miklos Szeredif9c34672018-01-19 11:39:52 +0100228extern struct dentry * d_instantiate_anon(struct dentry *, struct inode *);
Miklos Szeredib70a80e2013-10-01 16:44:54 +0200229extern int d_instantiate_no_diralias(struct dentry *, struct inode *);
Nick Piggin789680d2011-01-07 17:49:30 +1100230extern void __d_drop(struct dentry *dentry);
231extern void d_drop(struct dentry *dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232extern void d_delete(struct dentry *);
Nick Pigginfb045ad2011-01-07 17:49:55 +1100233extern void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234
235/* allocate/de-allocate */
236extern struct dentry * d_alloc(struct dentry *, const struct qstr *);
Miklos Szeredif9c34672018-01-19 11:39:52 +0100237extern struct dentry * d_alloc_anon(struct super_block *);
Nick Piggin4b936882011-01-07 17:50:07 +1100238extern struct dentry * d_alloc_pseudo(struct super_block *, const struct qstr *);
Al Virod9171b92016-04-15 03:33:13 -0400239extern struct dentry * d_alloc_parallel(struct dentry *, const struct qstr *,
240 wait_queue_head_t *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241extern struct dentry * d_splice_alias(struct inode *, struct dentry *);
Christoph Hellwige45b5902008-08-07 23:49:07 +0200242extern struct dentry * d_add_ci(struct dentry *, struct inode *, struct qstr *);
Al Viro668d0cd2016-03-08 12:44:17 -0500243extern struct dentry * d_exact_alias(struct dentry *, struct inode *);
Sage Weil46f72b32012-01-10 09:04:37 -0800244extern struct dentry *d_find_any_alias(struct inode *inode);
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +0200245extern struct dentry * d_obtain_alias(struct inode *);
J. Bruce Fields1a0a3972014-02-14 17:35:37 -0500246extern struct dentry * d_obtain_root(struct inode *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247extern void shrink_dcache_sb(struct super_block *);
248extern void shrink_dcache_parent(struct dentry *);
David Howellsc636ebd2006-10-11 01:22:19 -0700249extern void shrink_dcache_for_umount(struct super_block *);
Eric W. Biederman5542aa22014-02-13 09:46:25 -0800250extern void d_invalidate(struct dentry *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
252/* only used at mount-time */
Al Viroadc0e912012-01-08 16:49:21 -0500253extern struct dentry * d_make_root(struct inode *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254
255/* <clickety>-<click> the ramfs-type tree */
256extern void d_genocide(struct dentry *);
257
Al Viro60545d02013-06-07 01:20:27 -0400258extern void d_tmpfile(struct dentry *, struct inode *);
259
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260extern struct dentry *d_find_alias(struct inode *);
261extern void d_prune_aliases(struct inode *);
262
263/* test whether we have any submounts in a subdir tree */
Ian Kent01619492016-11-24 08:03:41 +1100264extern int path_has_submounts(const struct path *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265
266/*
267 * This adds the entry to the hash queues.
268 */
269extern void d_rehash(struct dentry *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270
Al Viro34d0d192016-03-08 21:01:03 -0500271extern void d_add(struct dentry *, struct inode *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272
Al Viro9aba36d2016-07-20 22:28:45 -0400273extern void dentry_update_name_case(struct dentry *, const struct qstr *);
Nick Pigginfb2d5b82011-01-07 17:49:26 +1100274
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275/* used for rename() and baskets */
276extern void d_move(struct dentry *, struct dentry *);
Miklos Szeredida1ce062014-04-01 17:08:43 +0200277extern void d_exchange(struct dentry *, struct dentry *);
OGAWA Hirofumie2761a12008-10-16 07:50:28 +0900278extern struct dentry *d_ancestor(struct dentry *, struct dentry *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279
280/* appendix may either be NULL or be used for transname suffixes */
Al Viroda2d8452013-01-24 18:29:34 -0500281extern struct dentry *d_lookup(const struct dentry *, const struct qstr *);
Nick Piggin31e6b012011-01-07 17:49:52 +1100282extern struct dentry *d_hash_and_lookup(struct dentry *, struct qstr *);
Al Viroa713ca22013-01-24 18:27:00 -0500283extern struct dentry *__d_lookup(const struct dentry *, const struct qstr *);
Linus Torvalds8966be92012-03-02 14:23:30 -0800284extern struct dentry *__d_lookup_rcu(const struct dentry *parent,
Linus Torvaldsda53be12013-05-21 15:22:44 -0700285 const struct qstr *name, unsigned *seq);
Nick Piggin31e6b012011-01-07 17:49:52 +1100286
Peng Tao24924a22013-07-18 22:09:08 +0800287static inline unsigned d_count(const struct dentry *dentry)
Al Viro84d08fa2013-07-05 18:59:33 +0400288{
Waiman Long98474232013-08-28 18:24:59 -0700289 return dentry->d_lockref.count;
Al Viro84d08fa2013-07-05 18:59:33 +0400290}
291
Eric Dumazetc23fbb62007-05-08 00:26:18 -0700292/*
293 * helper function for dentry_operations.d_dname() members
294 */
Nicolas Iooss8db14862015-07-17 16:23:42 -0700295extern __printf(4, 5)
296char *dynamic_dname(struct dentry *, char *, int, const char *, ...);
Al Viro118b2302013-08-24 12:08:17 -0400297extern char *simple_dname(struct dentry *, char *, int);
Eric Dumazetc23fbb62007-05-08 00:26:18 -0700298
Al Viro02125a82011-12-05 08:43:34 -0500299extern char *__d_path(const struct path *, const struct path *, char *, int);
300extern char *d_absolute_path(const struct path *, char *, int);
Jan Engelhardt20d4fdc2008-06-09 16:40:36 -0700301extern char *d_path(const struct path *, char *, int);
Nick Pigginec2447c2011-01-07 17:49:29 +1100302extern char *dentry_path_raw(struct dentry *, char *, int);
Ram Pai6092d042008-03-27 13:06:20 +0100303extern char *dentry_path(struct dentry *, char *, int);
Jan Blunckcf28b482008-02-14 19:38:44 -0800304
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305/* Allocation counts.. */
306
307/**
Nick Piggindc0474b2011-01-07 17:49:43 +1100308 * dget, dget_dlock - get a reference to a dentry
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309 * @dentry: dentry to get a reference to
310 *
311 * Given a dentry or %NULL pointer increment the reference count
312 * if appropriate and return the dentry. A dentry will not be
Nick Piggindc0474b2011-01-07 17:49:43 +1100313 * destroyed when it has references.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 */
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100315static inline struct dentry *dget_dlock(struct dentry *dentry)
316{
Nick Piggindc0474b2011-01-07 17:49:43 +1100317 if (dentry)
Waiman Long98474232013-08-28 18:24:59 -0700318 dentry->d_lockref.count++;
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100319 return dentry;
320}
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100321
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322static inline struct dentry *dget(struct dentry *dentry)
323{
Waiman Long98474232013-08-28 18:24:59 -0700324 if (dentry)
325 lockref_get(&dentry->d_lockref);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 return dentry;
327}
328
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100329extern struct dentry *dget_parent(struct dentry *dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330
331/**
332 * d_unhashed - is dentry hashed
333 * @dentry: entry to check
334 *
335 * Returns true if the dentry passed is not currently hashed.
336 */
337
Al Virof0d3b3d2013-09-05 12:11:29 -0400338static inline int d_unhashed(const struct dentry *dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339{
Linus Torvaldsdea36672011-04-24 07:58:46 -0700340 return hlist_bl_unhashed(&dentry->d_hash);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341}
342
Al Virof0d3b3d2013-09-05 12:11:29 -0400343static inline int d_unlinked(const struct dentry *dentry)
Alexey Dobriyanf3da3922009-05-04 03:32:03 +0400344{
345 return d_unhashed(dentry) && !IS_ROOT(dentry);
346}
347
Al Virof0d3b3d2013-09-05 12:11:29 -0400348static inline int cant_mount(const struct dentry *dentry)
Al Virod83c49f2010-04-30 17:17:09 -0400349{
350 return (dentry->d_flags & DCACHE_CANT_MOUNT);
351}
352
353static inline void dont_mount(struct dentry *dentry)
354{
355 spin_lock(&dentry->d_lock);
356 dentry->d_flags |= DCACHE_CANT_MOUNT;
357 spin_unlock(&dentry->d_lock);
358}
359
Al Viro85c7f812016-04-14 19:52:13 -0400360extern void __d_lookup_done(struct dentry *);
361
NeilBrown4ded0972017-10-20 11:41:17 +1100362static inline int d_in_lookup(const struct dentry *dentry)
Al Viro85c7f812016-04-14 19:52:13 -0400363{
364 return dentry->d_flags & DCACHE_PAR_LOOKUP;
365}
366
367static inline void d_lookup_done(struct dentry *dentry)
368{
369 if (unlikely(d_in_lookup(dentry))) {
370 spin_lock(&dentry->d_lock);
371 __d_lookup_done(dentry);
372 spin_unlock(&dentry->d_lock);
373 }
374}
375
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376extern void dput(struct dentry *);
377
Al Virof0d3b3d2013-09-05 12:11:29 -0400378static inline bool d_managed(const struct dentry *dentry)
David Howellscc53ce52011-01-14 18:45:26 +0000379{
380 return dentry->d_flags & DCACHE_MANAGED_DENTRY;
381}
382
Al Virof0d3b3d2013-09-05 12:11:29 -0400383static inline bool d_mountpoint(const struct dentry *dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384{
Nick Piggin5f57cbc2011-01-07 17:49:54 +1100385 return dentry->d_flags & DCACHE_MOUNTED;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386}
387
David Howellsb18825a2013-09-12 19:22:53 +0100388/*
389 * Directory cache entry type accessor functions.
390 */
David Howellsb18825a2013-09-12 19:22:53 +0100391static inline unsigned __d_entry_type(const struct dentry *dentry)
392{
Al Viroa528aca2016-02-29 12:12:46 -0500393 return dentry->d_flags & DCACHE_ENTRY_TYPE;
David Howellsb18825a2013-09-12 19:22:53 +0100394}
395
David Howellse7f7d222015-01-29 12:02:27 +0000396static inline bool d_is_miss(const struct dentry *dentry)
397{
398 return __d_entry_type(dentry) == DCACHE_MISS_TYPE;
399}
400
401static inline bool d_is_whiteout(const struct dentry *dentry)
402{
403 return __d_entry_type(dentry) == DCACHE_WHITEOUT_TYPE;
404}
405
Miklos Szeredi44b1d532014-04-01 17:08:41 +0200406static inline bool d_can_lookup(const struct dentry *dentry)
David Howellsb18825a2013-09-12 19:22:53 +0100407{
408 return __d_entry_type(dentry) == DCACHE_DIRECTORY_TYPE;
409}
410
411static inline bool d_is_autodir(const struct dentry *dentry)
412{
413 return __d_entry_type(dentry) == DCACHE_AUTODIR_TYPE;
414}
415
Miklos Szeredi44b1d532014-04-01 17:08:41 +0200416static inline bool d_is_dir(const struct dentry *dentry)
417{
418 return d_can_lookup(dentry) || d_is_autodir(dentry);
419}
420
David Howellsb18825a2013-09-12 19:22:53 +0100421static inline bool d_is_symlink(const struct dentry *dentry)
422{
423 return __d_entry_type(dentry) == DCACHE_SYMLINK_TYPE;
424}
425
David Howells44bdb5e2015-01-29 12:02:29 +0000426static inline bool d_is_reg(const struct dentry *dentry)
427{
428 return __d_entry_type(dentry) == DCACHE_REGULAR_TYPE;
429}
430
431static inline bool d_is_special(const struct dentry *dentry)
432{
433 return __d_entry_type(dentry) == DCACHE_SPECIAL_TYPE;
434}
435
David Howellsb18825a2013-09-12 19:22:53 +0100436static inline bool d_is_file(const struct dentry *dentry)
437{
David Howells44bdb5e2015-01-29 12:02:29 +0000438 return d_is_reg(dentry) || d_is_special(dentry);
David Howellsb18825a2013-09-12 19:22:53 +0100439}
440
441static inline bool d_is_negative(const struct dentry *dentry)
442{
David Howellse7f7d222015-01-29 12:02:27 +0000443 // TODO: check d_is_whiteout(dentry) also.
444 return d_is_miss(dentry);
David Howellsb18825a2013-09-12 19:22:53 +0100445}
446
447static inline bool d_is_positive(const struct dentry *dentry)
448{
449 return !d_is_negative(dentry);
450}
451
David Howells525d27b2015-02-11 13:40:17 +0000452/**
453 * d_really_is_negative - Determine if a dentry is really negative (ignoring fallthroughs)
454 * @dentry: The dentry in question
455 *
456 * Returns true if the dentry represents either an absent name or a name that
457 * doesn't map to an inode (ie. ->d_inode is NULL). The dentry could represent
458 * a true miss, a whiteout that isn't represented by a 0,0 chardev or a
459 * fallthrough marker in an opaque directory.
460 *
461 * Note! (1) This should be used *only* by a filesystem to examine its own
462 * dentries. It should not be used to look at some other filesystem's
463 * dentries. (2) It should also be used in combination with d_inode() to get
464 * the inode. (3) The dentry may have something attached to ->d_lower and the
465 * type field of the flags may be set to something other than miss or whiteout.
466 */
467static inline bool d_really_is_negative(const struct dentry *dentry)
468{
469 return dentry->d_inode == NULL;
470}
471
472/**
473 * d_really_is_positive - Determine if a dentry is really positive (ignoring fallthroughs)
474 * @dentry: The dentry in question
475 *
476 * Returns true if the dentry represents a name that maps to an inode
477 * (ie. ->d_inode is not NULL). The dentry might still represent a whiteout if
478 * that is represented on medium as a 0,0 chardev.
479 *
480 * Note! (1) This should be used *only* by a filesystem to examine its own
481 * dentries. It should not be used to look at some other filesystem's
482 * dentries. (2) It should also be used in combination with d_inode() to get
483 * the inode.
484 */
485static inline bool d_really_is_positive(const struct dentry *dentry)
486{
487 return dentry->d_inode != NULL;
488}
489
NeilBrown4ded0972017-10-20 11:41:17 +1100490static inline int simple_positive(const struct dentry *dentry)
Al Virodc3f4192015-05-18 10:10:34 -0400491{
492 return d_really_is_positive(dentry) && !d_unhashed(dentry);
493}
494
David Howellsdf1a0852015-01-29 12:02:28 +0000495extern void d_set_fallthru(struct dentry *dentry);
496
497static inline bool d_is_fallthru(const struct dentry *dentry)
498{
499 return dentry->d_flags & DCACHE_FALLTHRU;
500}
501
502
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503extern int sysctl_vfs_cache_pressure;
504
Glauber Costa55f841c2013-08-28 10:17:53 +1000505static inline unsigned long vfs_pressure_ratio(unsigned long val)
506{
507 return mult_frac(val, sysctl_vfs_cache_pressure, 100);
508}
David Howells155e35d2015-01-29 12:02:27 +0000509
510/**
511 * d_inode - Get the actual inode of this dentry
512 * @dentry: The dentry to query
513 *
514 * This is the helper normal filesystems should use to get at their own inodes
515 * in their own dentries and ignore the layering superimposed upon them.
516 */
517static inline struct inode *d_inode(const struct dentry *dentry)
518{
519 return dentry->d_inode;
520}
521
522/**
Mark Rutland66702eb2017-10-23 14:07:14 -0700523 * d_inode_rcu - Get the actual inode of this dentry with READ_ONCE()
David Howells155e35d2015-01-29 12:02:27 +0000524 * @dentry: The dentry to query
525 *
526 * This is the helper normal filesystems should use to get at their own inodes
527 * in their own dentries and ignore the layering superimposed upon them.
528 */
529static inline struct inode *d_inode_rcu(const struct dentry *dentry)
530{
Mark Rutland66702eb2017-10-23 14:07:14 -0700531 return READ_ONCE(dentry->d_inode);
David Howells155e35d2015-01-29 12:02:27 +0000532}
533
534/**
535 * d_backing_inode - Get upper or lower inode we should be using
536 * @upper: The upper layer
537 *
538 * This is the helper that should be used to get at the inode that will be used
539 * if this dentry were to be opened as a file. The inode may be on the upper
540 * dentry or it may be on a lower dentry pinned by the upper.
541 *
542 * Normal filesystems should not use this to access their own inodes.
543 */
544static inline struct inode *d_backing_inode(const struct dentry *upper)
545{
546 struct inode *inode = upper->d_inode;
547
548 return inode;
549}
550
551/**
552 * d_backing_dentry - Get upper or lower dentry we should be using
553 * @upper: The upper layer
554 *
555 * This is the helper that should be used to get the dentry of the inode that
556 * will be used if this dentry were opened as a file. It may be the upper
557 * dentry or it may be a lower dentry pinned by the upper.
558 *
559 * Normal filesystems should not use this to access their own dentries.
560 */
561static inline struct dentry *d_backing_dentry(struct dentry *upper)
562{
563 return upper;
564}
565
Miklos Szeredicd913042017-09-05 12:53:11 +0200566/* d_real() flags */
567#define D_REAL_UPPER 0x2 /* return upper dentry or NULL if non-upper */
568
Miklos Szeredie698b8a2016-06-30 08:53:27 +0200569/**
570 * d_real - Return the real dentry
571 * @dentry: the dentry to query
572 * @inode: inode to select the dentry from multiple layers (can be NULL)
Miklos Szeredi495e6422017-09-04 21:42:22 +0200573 * @open_flags: open flags to control copy-up behavior
574 * @flags: flags to control what is returned by this function
Miklos Szeredie698b8a2016-06-30 08:53:27 +0200575 *
Masahiro Yamada03440c42017-02-27 14:28:49 -0800576 * If dentry is on a union/overlay, then return the underlying, real dentry.
Miklos Szeredie698b8a2016-06-30 08:53:27 +0200577 * Otherwise return the dentry itself.
578 *
579 * See also: Documentation/filesystems/vfs.txt
580 */
Miklos Szeredi2d902672016-06-30 08:53:27 +0200581static inline struct dentry *d_real(struct dentry *dentry,
582 const struct inode *inode,
Miklos Szeredi495e6422017-09-04 21:42:22 +0200583 unsigned int open_flags, unsigned int flags)
Miklos Szeredid101a122016-03-26 16:14:37 -0400584{
585 if (unlikely(dentry->d_flags & DCACHE_OP_REAL))
Miklos Szeredi495e6422017-09-04 21:42:22 +0200586 return dentry->d_op->d_real(dentry, inode, open_flags, flags);
Miklos Szeredid101a122016-03-26 16:14:37 -0400587 else
588 return dentry;
589}
590
Miklos Szeredia1180842016-05-20 22:13:45 +0200591/**
592 * d_real_inode - Return the real inode
593 * @dentry: The dentry to query
594 *
Masahiro Yamada03440c42017-02-27 14:28:49 -0800595 * If dentry is on a union/overlay, then return the underlying, real inode.
Miklos Szeredia1180842016-05-20 22:13:45 +0200596 * Otherwise return d_inode().
597 */
Miklos Szeredi7b1742e2016-09-16 12:44:20 +0200598static inline struct inode *d_real_inode(const struct dentry *dentry)
Miklos Szeredia1180842016-05-20 22:13:45 +0200599{
Miklos Szeredi7b1742e2016-09-16 12:44:20 +0200600 /* This usage of d_real() results in const dentry */
Miklos Szeredi495e6422017-09-04 21:42:22 +0200601 return d_backing_inode(d_real((struct dentry *) dentry, NULL, 0, 0));
Miklos Szeredia1180842016-05-20 22:13:45 +0200602}
603
Al Viro49d31c22017-07-07 14:51:19 -0400604struct name_snapshot {
Stephen Rothwell0a2c13d2017-07-12 14:33:01 -0700605 const unsigned char *name;
606 unsigned char inline_name[DNAME_INLINE_LEN];
Al Viro49d31c22017-07-07 14:51:19 -0400607};
608void take_dentry_name_snapshot(struct name_snapshot *, struct dentry *);
609void release_dentry_name_snapshot(struct name_snapshot *);
Miklos Szeredi54d5ca82016-05-11 01:16:37 +0200610
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611#endif /* __LINUX_DCACHE_H */