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