vfs: document ->d_real()
[deliverable/linux.git] / include / linux / dcache.h
CommitLineData
1da177e4
LT
1#ifndef __LINUX_DCACHE_H
2#define __LINUX_DCACHE_H
3
60063497 4#include <linux/atomic.h>
1da177e4 5#include <linux/list.h>
82524746 6#include <linux/rculist.h>
ceb5bdc2 7#include <linux/rculist_bl.h>
1da177e4 8#include <linux/spinlock.h>
31e6b01f 9#include <linux/seqlock.h>
1da177e4
LT
10#include <linux/cache.h>
11#include <linux/rcupdate.h>
98474236 12#include <linux/lockref.h>
f4bcbe79 13#include <linux/stringhash.h>
1da177e4 14
cf28b486 15struct path;
1da177e4
LT
16struct vfsmount;
17
18/*
19 * linux/include/linux/dcache.h
20 *
21 * Dirent cache data structures
22 *
23 * (C) Copyright 1997 Thomas Schoebel-Theuer,
24 * with heavy changes by Linus Torvalds
25 */
26
27#define IS_ROOT(x) ((x) == (x)->d_parent)
28
26fe5750
LT
29/* The hash is always the low bits of hash_len */
30#ifdef __LITTLE_ENDIAN
2bd03e49 31 #define HASH_LEN_DECLARE u32 hash; u32 len
a5c21dce 32 #define bytemask_from_count(cnt) (~(~0ul << (cnt)*8))
26fe5750 33#else
2bd03e49 34 #define HASH_LEN_DECLARE u32 len; u32 hash
a5c21dce 35 #define bytemask_from_count(cnt) (~(~0ul >> (cnt)*8))
26fe5750
LT
36#endif
37
1da177e4
LT
38/*
39 * "quick string" -- eases parameter passing, but more importantly
40 * saves "metadata" about the string (ie length and the hash).
41 *
42 * hash comes first so it snuggles against d_parent in the
43 * dentry.
44 */
45struct qstr {
26fe5750
LT
46 union {
47 struct {
48 HASH_LEN_DECLARE;
49 };
50 u64 hash_len;
51 };
1da177e4
LT
52 const unsigned char *name;
53};
54
26fe5750 55#define QSTR_INIT(n,l) { { { .len = l } }, .name = n }
26fe5750 56
1da177e4 57struct dentry_stat_t {
3942c07c
GC
58 long nr_dentry;
59 long nr_unused;
60 long age_limit; /* age in seconds */
61 long want_pages; /* pages requested by system */
62 long dummy[2];
1da177e4
LT
63};
64extern struct dentry_stat_t dentry_stat;
65
c2452f32
NP
66/*
67 * Try to keep struct dentry aligned on 64 byte cachelines (this will
68 * give reasonable cacheline footprint with larger lines without the
69 * large memory footprint increase).
70 */
71#ifdef CONFIG_64BIT
44a7d7a8 72# define DNAME_INLINE_LEN 32 /* 192 bytes */
c2452f32 73#else
44a7d7a8
NP
74# ifdef CONFIG_SMP
75# define DNAME_INLINE_LEN 36 /* 128 bytes */
76# else
77# define DNAME_INLINE_LEN 40 /* 128 bytes */
78# endif
c2452f32 79#endif
1da177e4 80
98474236
WL
81#define d_lock d_lockref.lock
82
1da177e4 83struct dentry {
44a7d7a8 84 /* RCU lookup touched fields */
1da177e4 85 unsigned int d_flags; /* protected by d_lock */
31e6b01f 86 seqcount_t d_seq; /* per dentry seqlock */
ceb5bdc2 87 struct hlist_bl_node d_hash; /* lookup hash list */
1da177e4
LT
88 struct dentry *d_parent; /* parent directory */
89 struct qstr d_name;
44a7d7a8
NP
90 struct inode *d_inode; /* Where the name belongs to - NULL is
91 * negative */
92 unsigned char d_iname[DNAME_INLINE_LEN]; /* small names */
93
94 /* Ref lookup also touches following */
98474236 95 struct lockref d_lockref; /* per-dentry lock and refcount */
44a7d7a8
NP
96 const struct dentry_operations *d_op;
97 struct super_block *d_sb; /* The root of the dentry tree */
98 unsigned long d_time; /* used by d_revalidate */
99 void *d_fsdata; /* fs-specific data */
1da177e4 100
d9171b93
AV
101 union {
102 struct list_head d_lru; /* LRU list */
103 wait_queue_head_t *d_wait; /* in-lookup ones only */
104 };
946e51f2
AV
105 struct list_head d_child; /* child of parent list */
106 struct list_head d_subdirs; /* our children */
5160ee6f 107 /*
946e51f2 108 * d_alias and d_rcu can share memory
5160ee6f
ED
109 */
110 union {
946e51f2 111 struct hlist_node d_alias; /* inode alias list */
94bdd655 112 struct hlist_bl_node d_in_lookup_hash; /* only for in-lookup ones */
5160ee6f
ED
113 struct rcu_head d_rcu;
114 } d_u;
1da177e4
LT
115};
116
a90b9c05
IM
117/*
118 * dentry->d_lock spinlock nesting subclasses:
119 *
120 * 0: normal
121 * 1: nested
122 */
123enum dentry_d_lock_class
124{
125 DENTRY_D_LOCK_NORMAL, /* implicitly used by plain spin_lock() APIs. */
126 DENTRY_D_LOCK_NESTED
127};
128
1da177e4 129struct dentry_operations {
0b728e19 130 int (*d_revalidate)(struct dentry *, unsigned int);
ecf3d1f1 131 int (*d_weak_revalidate)(struct dentry *, unsigned int);
da53be12
LT
132 int (*d_hash)(const struct dentry *, struct qstr *);
133 int (*d_compare)(const struct dentry *, const struct dentry *,
621e155a 134 unsigned int, const char *, const struct qstr *);
fe15ce44 135 int (*d_delete)(const struct dentry *);
1da177e4 136 void (*d_release)(struct dentry *);
f0023bc6 137 void (*d_prune)(struct dentry *);
1da177e4 138 void (*d_iput)(struct dentry *, struct inode *);
c23fbb6b 139 char *(*d_dname)(struct dentry *, char *, int);
9875cf80 140 struct vfsmount *(*d_automount)(struct path *);
1aed3e42 141 int (*d_manage)(struct dentry *, bool);
e698b8a4
MS
142 struct dentry *(*d_real)(struct dentry *, const struct inode *,
143 unsigned int);
44a7d7a8 144} ____cacheline_aligned;
1da177e4 145
5eef7fa9
NP
146/*
147 * Locking rules for dentry_operations callbacks are to be found in
148 * Documentation/filesystems/Locking. Keep it updated!
149 *
621e155a
NP
150 * FUrther descriptions are found in Documentation/filesystems/vfs.txt.
151 * Keep it updated too!
1da177e4
LT
152 */
153
154/* d_flags entries */
b18825a7
DH
155#define DCACHE_OP_HASH 0x00000001
156#define DCACHE_OP_COMPARE 0x00000002
157#define DCACHE_OP_REVALIDATE 0x00000004
158#define DCACHE_OP_DELETE 0x00000008
159#define DCACHE_OP_PRUNE 0x00000010
5f57cbcc 160
b18825a7 161#define DCACHE_DISCONNECTED 0x00000020
5f57cbcc
NP
162 /* This dentry is possibly not currently connected to the dcache tree, in
163 * which case its parent will either be itself, or will have this flag as
164 * well. nfsd will not use a dentry with this bit set, but will first
165 * endeavour to clear the bit either by discovering that it is connected,
166 * or by performing lookup operations. Any filesystem which supports
167 * nfsd_operations MUST have a lookup function which, if it finds a
168 * directory inode with a DCACHE_DISCONNECTED dentry, will d_move that
169 * dentry into place and return that dentry rather than the passed one,
170 * typically using d_splice_alias. */
1da177e4 171
b18825a7
DH
172#define DCACHE_REFERENCED 0x00000040 /* Recently used, don't discard. */
173#define DCACHE_RCUACCESS 0x00000080 /* Entry has ever been RCU-visible */
c28f7e56 174
b18825a7
DH
175#define DCACHE_CANT_MOUNT 0x00000100
176#define DCACHE_GENOCIDE 0x00000200
177#define DCACHE_SHRINK_LIST 0x00000400
5f57cbcc 178
b18825a7 179#define DCACHE_OP_WEAK_REVALIDATE 0x00000800
ecf3d1f1 180
b18825a7 181#define DCACHE_NFSFS_RENAMED 0x00001000
830c0f0e
LT
182 /* this dentry has been "silly renamed" and has to be deleted on the last
183 * dput() */
b18825a7
DH
184#define DCACHE_COOKIE 0x00002000 /* For use by dcookie subsystem */
185#define DCACHE_FSNOTIFY_PARENT_WATCHED 0x00004000
830c0f0e 186 /* Parent inode is watched by some fsnotify listener */
fb045adb 187
b18825a7
DH
188#define DCACHE_DENTRY_KILLED 0x00008000
189
190#define DCACHE_MOUNTED 0x00010000 /* is a mountpoint */
191#define DCACHE_NEED_AUTOMOUNT 0x00020000 /* handle automount on this dir */
192#define DCACHE_MANAGE_TRANSIT 0x00040000 /* manage transit from this dirent */
9875cf80 193#define DCACHE_MANAGED_DENTRY \
cc53ce53 194 (DCACHE_MOUNTED|DCACHE_NEED_AUTOMOUNT|DCACHE_MANAGE_TRANSIT)
9875cf80 195
b18825a7
DH
196#define DCACHE_LRU_LIST 0x00080000
197
198#define DCACHE_ENTRY_TYPE 0x00700000
e7f7d225
DH
199#define DCACHE_MISS_TYPE 0x00000000 /* Negative dentry (maybe fallthru to nowhere) */
200#define DCACHE_WHITEOUT_TYPE 0x00100000 /* Whiteout dentry (stop pathwalk) */
201#define DCACHE_DIRECTORY_TYPE 0x00200000 /* Normal directory */
202#define DCACHE_AUTODIR_TYPE 0x00300000 /* Lookupless directory (presumed automount) */
44bdb5e5
DH
203#define DCACHE_REGULAR_TYPE 0x00400000 /* Regular file type (or fallthru to such) */
204#define DCACHE_SPECIAL_TYPE 0x00500000 /* Other file type (or fallthru to such) */
205#define DCACHE_SYMLINK_TYPE 0x00600000 /* Symlink (or fallthru to such) */
b161dfa6 206
41edf278 207#define DCACHE_MAY_FREE 0x00800000
df1a085a 208#define DCACHE_FALLTHRU 0x01000000 /* Fall through to lower layer */
2d902671
MS
209#define DCACHE_ENCRYPTED_WITH_KEY 0x02000000 /* dir is encrypted with a valid key */
210#define DCACHE_OP_REAL 0x04000000
0b81d077 211
85c7f810 212#define DCACHE_PAR_LOOKUP 0x10000000 /* being looked up (with parent locked shared) */
ba65dc5e 213#define DCACHE_DENTRY_CURSOR 0x20000000
85c7f810 214
74c3cbe3 215extern seqlock_t rename_lock;
1da177e4 216
1da177e4
LT
217/*
218 * These are the low-level FS interfaces to the dcache..
219 */
220extern void d_instantiate(struct dentry *, struct inode *);
221extern struct dentry * d_instantiate_unique(struct dentry *, struct inode *);
b70a80e7 222extern int d_instantiate_no_diralias(struct dentry *, struct inode *);
789680d1
NP
223extern void __d_drop(struct dentry *dentry);
224extern void d_drop(struct dentry *dentry);
1da177e4 225extern void d_delete(struct dentry *);
fb045adb 226extern void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op);
1da177e4
LT
227
228/* allocate/de-allocate */
229extern struct dentry * d_alloc(struct dentry *, const struct qstr *);
4b936885 230extern struct dentry * d_alloc_pseudo(struct super_block *, const struct qstr *);
d9171b93
AV
231extern struct dentry * d_alloc_parallel(struct dentry *, const struct qstr *,
232 wait_queue_head_t *);
1da177e4 233extern struct dentry * d_splice_alias(struct inode *, struct dentry *);
e45b590b 234extern struct dentry * d_add_ci(struct dentry *, struct inode *, struct qstr *);
668d0cd5 235extern struct dentry * d_exact_alias(struct dentry *, struct inode *);
46f72b34 236extern struct dentry *d_find_any_alias(struct inode *inode);
4ea3ada2 237extern struct dentry * d_obtain_alias(struct inode *);
1a0a397e 238extern struct dentry * d_obtain_root(struct inode *);
1da177e4
LT
239extern void shrink_dcache_sb(struct super_block *);
240extern void shrink_dcache_parent(struct dentry *);
c636ebdb 241extern void shrink_dcache_for_umount(struct super_block *);
5542aa2f 242extern void d_invalidate(struct dentry *);
1da177e4
LT
243
244/* only used at mount-time */
adc0e91a 245extern struct dentry * d_make_root(struct inode *);
1da177e4
LT
246
247/* <clickety>-<click> the ramfs-type tree */
248extern void d_genocide(struct dentry *);
249
60545d0d
AV
250extern void d_tmpfile(struct dentry *, struct inode *);
251
1da177e4
LT
252extern struct dentry *d_find_alias(struct inode *);
253extern void d_prune_aliases(struct inode *);
254
255/* test whether we have any submounts in a subdir tree */
256extern int have_submounts(struct dentry *);
257
258/*
259 * This adds the entry to the hash queues.
260 */
261extern void d_rehash(struct dentry *);
1da177e4 262
34d0d19d 263extern void d_add(struct dentry *, struct inode *);
1da177e4 264
fb2d5b86
NP
265extern void dentry_update_name_case(struct dentry *, struct qstr *);
266
1da177e4
LT
267/* used for rename() and baskets */
268extern void d_move(struct dentry *, struct dentry *);
da1ce067 269extern void d_exchange(struct dentry *, struct dentry *);
e2761a11 270extern struct dentry *d_ancestor(struct dentry *, struct dentry *);
1da177e4
LT
271
272/* appendix may either be NULL or be used for transname suffixes */
da2d8455 273extern struct dentry *d_lookup(const struct dentry *, const struct qstr *);
31e6b01f 274extern struct dentry *d_hash_and_lookup(struct dentry *, struct qstr *);
a713ca2a 275extern struct dentry *__d_lookup(const struct dentry *, const struct qstr *);
8966be90 276extern struct dentry *__d_lookup_rcu(const struct dentry *parent,
da53be12 277 const struct qstr *name, unsigned *seq);
31e6b01f 278
24924a20 279static inline unsigned d_count(const struct dentry *dentry)
84d08fa8 280{
98474236 281 return dentry->d_lockref.count;
84d08fa8
AV
282}
283
c23fbb6b
ED
284/*
285 * helper function for dentry_operations.d_dname() members
286 */
8db14860
NI
287extern __printf(4, 5)
288char *dynamic_dname(struct dentry *, char *, int, const char *, ...);
118b2302 289extern char *simple_dname(struct dentry *, char *, int);
c23fbb6b 290
02125a82
AV
291extern char *__d_path(const struct path *, const struct path *, char *, int);
292extern char *d_absolute_path(const struct path *, char *, int);
20d4fdc1 293extern char *d_path(const struct path *, char *, int);
ec2447c2 294extern char *dentry_path_raw(struct dentry *, char *, int);
6092d048 295extern char *dentry_path(struct dentry *, char *, int);
cf28b486 296
1da177e4
LT
297/* Allocation counts.. */
298
299/**
dc0474be 300 * dget, dget_dlock - get a reference to a dentry
1da177e4
LT
301 * @dentry: dentry to get a reference to
302 *
303 * Given a dentry or %NULL pointer increment the reference count
304 * if appropriate and return the dentry. A dentry will not be
dc0474be 305 * destroyed when it has references.
1da177e4 306 */
b7ab39f6
NP
307static inline struct dentry *dget_dlock(struct dentry *dentry)
308{
dc0474be 309 if (dentry)
98474236 310 dentry->d_lockref.count++;
b7ab39f6
NP
311 return dentry;
312}
2fd6b7f5 313
1da177e4
LT
314static inline struct dentry *dget(struct dentry *dentry)
315{
98474236
WL
316 if (dentry)
317 lockref_get(&dentry->d_lockref);
1da177e4
LT
318 return dentry;
319}
320
b7ab39f6 321extern struct dentry *dget_parent(struct dentry *dentry);
1da177e4
LT
322
323/**
324 * d_unhashed - is dentry hashed
325 * @dentry: entry to check
326 *
327 * Returns true if the dentry passed is not currently hashed.
328 */
329
f0d3b3de 330static inline int d_unhashed(const struct dentry *dentry)
1da177e4 331{
dea3667b 332 return hlist_bl_unhashed(&dentry->d_hash);
1da177e4
LT
333}
334
f0d3b3de 335static inline int d_unlinked(const struct dentry *dentry)
f3da392e
AD
336{
337 return d_unhashed(dentry) && !IS_ROOT(dentry);
338}
339
f0d3b3de 340static inline int cant_mount(const struct dentry *dentry)
d83c49f3
AV
341{
342 return (dentry->d_flags & DCACHE_CANT_MOUNT);
343}
344
345static inline void dont_mount(struct dentry *dentry)
346{
347 spin_lock(&dentry->d_lock);
348 dentry->d_flags |= DCACHE_CANT_MOUNT;
349 spin_unlock(&dentry->d_lock);
350}
351
85c7f810
AV
352extern void __d_lookup_done(struct dentry *);
353
354static inline int d_in_lookup(struct dentry *dentry)
355{
356 return dentry->d_flags & DCACHE_PAR_LOOKUP;
357}
358
359static inline void d_lookup_done(struct dentry *dentry)
360{
361 if (unlikely(d_in_lookup(dentry))) {
362 spin_lock(&dentry->d_lock);
363 __d_lookup_done(dentry);
364 spin_unlock(&dentry->d_lock);
365 }
366}
367
1da177e4
LT
368extern void dput(struct dentry *);
369
f0d3b3de 370static inline bool d_managed(const struct dentry *dentry)
cc53ce53
DH
371{
372 return dentry->d_flags & DCACHE_MANAGED_DENTRY;
373}
374
f0d3b3de 375static inline bool d_mountpoint(const struct dentry *dentry)
1da177e4 376{
5f57cbcc 377 return dentry->d_flags & DCACHE_MOUNTED;
1da177e4
LT
378}
379
b18825a7
DH
380/*
381 * Directory cache entry type accessor functions.
382 */
b18825a7
DH
383static inline unsigned __d_entry_type(const struct dentry *dentry)
384{
a528aca7 385 return dentry->d_flags & DCACHE_ENTRY_TYPE;
b18825a7
DH
386}
387
e7f7d225
DH
388static inline bool d_is_miss(const struct dentry *dentry)
389{
390 return __d_entry_type(dentry) == DCACHE_MISS_TYPE;
391}
392
393static inline bool d_is_whiteout(const struct dentry *dentry)
394{
395 return __d_entry_type(dentry) == DCACHE_WHITEOUT_TYPE;
396}
397
44b1d530 398static inline bool d_can_lookup(const struct dentry *dentry)
b18825a7
DH
399{
400 return __d_entry_type(dentry) == DCACHE_DIRECTORY_TYPE;
401}
402
403static inline bool d_is_autodir(const struct dentry *dentry)
404{
405 return __d_entry_type(dentry) == DCACHE_AUTODIR_TYPE;
406}
407
44b1d530
MS
408static inline bool d_is_dir(const struct dentry *dentry)
409{
410 return d_can_lookup(dentry) || d_is_autodir(dentry);
411}
412
b18825a7
DH
413static inline bool d_is_symlink(const struct dentry *dentry)
414{
415 return __d_entry_type(dentry) == DCACHE_SYMLINK_TYPE;
416}
417
44bdb5e5
DH
418static inline bool d_is_reg(const struct dentry *dentry)
419{
420 return __d_entry_type(dentry) == DCACHE_REGULAR_TYPE;
421}
422
423static inline bool d_is_special(const struct dentry *dentry)
424{
425 return __d_entry_type(dentry) == DCACHE_SPECIAL_TYPE;
426}
427
b18825a7
DH
428static inline bool d_is_file(const struct dentry *dentry)
429{
44bdb5e5 430 return d_is_reg(dentry) || d_is_special(dentry);
b18825a7
DH
431}
432
433static inline bool d_is_negative(const struct dentry *dentry)
434{
e7f7d225
DH
435 // TODO: check d_is_whiteout(dentry) also.
436 return d_is_miss(dentry);
b18825a7
DH
437}
438
439static inline bool d_is_positive(const struct dentry *dentry)
440{
441 return !d_is_negative(dentry);
442}
443
525d27b2
DH
444/**
445 * d_really_is_negative - Determine if a dentry is really negative (ignoring fallthroughs)
446 * @dentry: The dentry in question
447 *
448 * Returns true if the dentry represents either an absent name or a name that
449 * doesn't map to an inode (ie. ->d_inode is NULL). The dentry could represent
450 * a true miss, a whiteout that isn't represented by a 0,0 chardev or a
451 * fallthrough marker in an opaque directory.
452 *
453 * Note! (1) This should be used *only* by a filesystem to examine its own
454 * dentries. It should not be used to look at some other filesystem's
455 * dentries. (2) It should also be used in combination with d_inode() to get
456 * the inode. (3) The dentry may have something attached to ->d_lower and the
457 * type field of the flags may be set to something other than miss or whiteout.
458 */
459static inline bool d_really_is_negative(const struct dentry *dentry)
460{
461 return dentry->d_inode == NULL;
462}
463
464/**
465 * d_really_is_positive - Determine if a dentry is really positive (ignoring fallthroughs)
466 * @dentry: The dentry in question
467 *
468 * Returns true if the dentry represents a name that maps to an inode
469 * (ie. ->d_inode is not NULL). The dentry might still represent a whiteout if
470 * that is represented on medium as a 0,0 chardev.
471 *
472 * Note! (1) This should be used *only* by a filesystem to examine its own
473 * dentries. It should not be used to look at some other filesystem's
474 * dentries. (2) It should also be used in combination with d_inode() to get
475 * the inode.
476 */
477static inline bool d_really_is_positive(const struct dentry *dentry)
478{
479 return dentry->d_inode != NULL;
480}
481
dc3f4198
AV
482static inline int simple_positive(struct dentry *dentry)
483{
484 return d_really_is_positive(dentry) && !d_unhashed(dentry);
485}
486
df1a085a
DH
487extern void d_set_fallthru(struct dentry *dentry);
488
489static inline bool d_is_fallthru(const struct dentry *dentry)
490{
491 return dentry->d_flags & DCACHE_FALLTHRU;
492}
493
494
1da177e4
LT
495extern int sysctl_vfs_cache_pressure;
496
55f841ce
GC
497static inline unsigned long vfs_pressure_ratio(unsigned long val)
498{
499 return mult_frac(val, sysctl_vfs_cache_pressure, 100);
500}
155e35d4
DH
501
502/**
503 * d_inode - Get the actual inode of this dentry
504 * @dentry: The dentry to query
505 *
506 * This is the helper normal filesystems should use to get at their own inodes
507 * in their own dentries and ignore the layering superimposed upon them.
508 */
509static inline struct inode *d_inode(const struct dentry *dentry)
510{
511 return dentry->d_inode;
512}
513
514/**
515 * d_inode_rcu - Get the actual inode of this dentry with ACCESS_ONCE()
516 * @dentry: The dentry to query
517 *
518 * This is the helper normal filesystems should use to get at their own inodes
519 * in their own dentries and ignore the layering superimposed upon them.
520 */
521static inline struct inode *d_inode_rcu(const struct dentry *dentry)
522{
523 return ACCESS_ONCE(dentry->d_inode);
524}
525
526/**
527 * d_backing_inode - Get upper or lower inode we should be using
528 * @upper: The upper layer
529 *
530 * This is the helper that should be used to get at the inode that will be used
531 * if this dentry were to be opened as a file. The inode may be on the upper
532 * dentry or it may be on a lower dentry pinned by the upper.
533 *
534 * Normal filesystems should not use this to access their own inodes.
535 */
536static inline struct inode *d_backing_inode(const struct dentry *upper)
537{
538 struct inode *inode = upper->d_inode;
539
540 return inode;
541}
542
543/**
544 * d_backing_dentry - Get upper or lower dentry we should be using
545 * @upper: The upper layer
546 *
547 * This is the helper that should be used to get the dentry of the inode that
548 * will be used if this dentry were opened as a file. It may be the upper
549 * dentry or it may be a lower dentry pinned by the upper.
550 *
551 * Normal filesystems should not use this to access their own dentries.
552 */
553static inline struct dentry *d_backing_dentry(struct dentry *upper)
554{
555 return upper;
556}
557
e698b8a4
MS
558/**
559 * d_real - Return the real dentry
560 * @dentry: the dentry to query
561 * @inode: inode to select the dentry from multiple layers (can be NULL)
562 * @flags: open flags to control copy-up behavior
563 *
564 * If dentry is on an union/overlay, then return the underlying, real dentry.
565 * Otherwise return the dentry itself.
566 *
567 * See also: Documentation/filesystems/vfs.txt
568 */
2d902671
MS
569static inline struct dentry *d_real(struct dentry *dentry,
570 const struct inode *inode,
571 unsigned int flags)
d101a125
MS
572{
573 if (unlikely(dentry->d_flags & DCACHE_OP_REAL))
2d902671 574 return dentry->d_op->d_real(dentry, inode, flags);
d101a125
MS
575 else
576 return dentry;
577}
578
a1180844
MS
579/**
580 * d_real_inode - Return the real inode
581 * @dentry: The dentry to query
582 *
583 * If dentry is on an union/overlay, then return the underlying, real inode.
584 * Otherwise return d_inode().
585 */
586static inline struct inode *d_real_inode(struct dentry *dentry)
587{
2d902671 588 return d_backing_inode(d_real(dentry, NULL, 0));
a1180844
MS
589}
590
54d5ca87 591
1da177e4 592#endif /* __LINUX_DCACHE_H */
This page took 0.987189 seconds and 5 git commands to generate.