dcache.h 18 KB

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