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