dcache.h 18 KB

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