dcache.h 18 KB

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