1 #ifndef __LINUX_DCACHE_H
2 #define __LINUX_DCACHE_H
6 #include <asm/atomic.h>
7 #include <linux/list.h>
8 #include <linux/spinlock.h>
9 #include <linux/cache.h>
10 #include <linux/rcupdate.h>
16 * linux/include/linux/dcache.h
18 * Dirent cache data structures
20 * (C) Copyright 1997 Thomas Schoebel-Theuer,
21 * with heavy changes by Linus Torvalds
24 #define IS_ROOT(x) ((x) == (x)->d_parent)
27 * "quick string" -- eases parameter passing, but more importantly
28 * saves "metadata" about the string (ie length and the hash).
30 * hash comes first so it snuggles against d_parent in the
36 const unsigned char *name;
39 struct dentry_stat_t {
42 int age_limit; /* age in seconds */
43 int want_pages; /* pages requested by system */
46 extern struct dentry_stat_t dentry_stat;
48 /* Name hashing routines. Initial hash value */
49 /* Hash courtesy of the R5 hash in reiserfs modulo sign bits */
50 #define init_name_hash() 0
52 /* partial hash update function. Assume roughly 4 bits per character */
53 static inline unsigned long
54 partial_name_hash(unsigned long c, unsigned long prevhash)
56 return (prevhash + (c << 4) + (c >> 4)) * 11;
60 * Finally: cut down the number of bits to a int value (and try to avoid
63 static inline unsigned long end_name_hash(unsigned long hash)
65 return (unsigned int) hash;
68 /* Compute the hash for a name string. */
69 static inline unsigned int
70 full_name_hash(const unsigned char *name, unsigned int len)
72 unsigned long hash = init_name_hash();
74 hash = partial_name_hash(*name++, hash);
75 return end_name_hash(hash);
78 struct dcookie_struct;
80 #define DNAME_INLINE_LEN_MIN 36
84 unsigned int d_flags; /* protected by d_lock */
85 spinlock_t d_lock; /* per dentry lock */
86 struct inode *d_inode; /* Where the name belongs to - NULL is
89 * The next three fields are touched by __d_lookup. Place them here
90 * so they all fit in a cache line.
92 struct hlist_node d_hash; /* lookup hash list */
93 struct dentry *d_parent; /* parent directory */
96 struct list_head d_lru; /* LRU list */
98 * d_child and d_rcu can share memory
101 struct list_head d_child; /* child of parent list */
102 struct rcu_head d_rcu;
104 struct list_head d_subdirs; /* our children */
105 struct list_head d_alias; /* inode alias list */
106 unsigned long d_time; /* used by d_revalidate */
107 struct dentry_operations *d_op;
108 struct super_block *d_sb; /* The root of the dentry tree */
109 void *d_fsdata; /* fs-specific data */
110 void *d_extra_attributes; /* TUX-specific data */
111 #ifdef CONFIG_PROFILING
112 struct dcookie_struct *d_cookie; /* cookie, if any */
115 unsigned char d_iname[DNAME_INLINE_LEN_MIN]; /* small names */
118 struct dentry_operations {
119 int (*d_revalidate)(struct dentry *, struct nameidata *);
120 int (*d_hash) (struct dentry *, struct qstr *);
121 int (*d_compare) (struct dentry *, struct qstr *, struct qstr *);
122 int (*d_delete)(struct dentry *);
123 void (*d_release)(struct dentry *);
124 void (*d_iput)(struct dentry *, struct inode *);
127 /* the dentry parameter passed to d_hash and d_compare is the parent
128 * directory of the entries to be compared. It is used in case these
129 * functions need any directory specific information for determining
130 * equivalency classes. Using the dentry itself might not work, as it
131 * might be a negative dentry which has no information associated with
136 big lock dcache_lock d_lock may block
137 d_revalidate: no no no yes
139 d_compare: no yes yes no
140 d_delete: no yes no no
141 d_release: no no no yes
145 /* d_flags entries */
146 #define DCACHE_AUTOFS_PENDING 0x0001 /* autofs: "under construction" */
147 #define DCACHE_NFSFS_RENAMED 0x0002 /* this dentry has been "silly
148 * renamed" and has to be
149 * deleted on the last dput()
151 #define DCACHE_DISCONNECTED 0x0004
152 /* This dentry is possibly not currently connected to the dcache tree,
153 * in which case its parent will either be itself, or will have this
154 * flag as well. nfsd will not use a dentry with this bit set, but will
155 * first endeavour to clear the bit either by discovering that it is
156 * connected, or by performing lookup operations. Any filesystem which
157 * supports nfsd_operations MUST have a lookup function which, if it finds
158 * a directory inode with a DCACHE_DISCONNECTED dentry, will d_move
159 * that dentry into place and return that dentry rather than the passed one,
160 * typically using d_splice_alias.
163 #define DCACHE_REFERENCED 0x0008 /* Recently used, don't discard. */
164 #define DCACHE_UNHASHED 0x0010
166 #define DCACHE_INOTIFY_PARENT_WATCHED 0x0020 /* Parent inode is watched */
168 extern spinlock_t dcache_lock;
171 * d_drop - drop a dentry
172 * @dentry: dentry to drop
174 * d_drop() unhashes the entry from the parent dentry hashes, so that it won't
175 * be found through a VFS lookup any more. Note that this is different from
176 * deleting the dentry - d_delete will try to mark the dentry negative if
177 * possible, giving a successful _negative_ lookup, while d_drop will
178 * just make the cache lookup fail.
180 * d_drop() is used mainly for stuff that wants to invalidate a dentry for some
181 * reason (NFS timeouts or autofs deletes).
183 * __d_drop requires dentry->d_lock.
186 static inline void __d_drop(struct dentry *dentry)
188 if (!(dentry->d_flags & DCACHE_UNHASHED)) {
189 dentry->d_flags |= DCACHE_UNHASHED;
190 hlist_del_rcu(&dentry->d_hash);
194 static inline void d_drop(struct dentry *dentry)
196 spin_lock(&dcache_lock);
197 spin_lock(&dentry->d_lock);
199 spin_unlock(&dentry->d_lock);
200 spin_unlock(&dcache_lock);
203 static inline int dname_external(struct dentry *dentry)
205 return dentry->d_name.name != dentry->d_iname;
209 * These are the low-level FS interfaces to the dcache..
211 extern void d_instantiate(struct dentry *, struct inode *);
212 extern struct dentry * d_instantiate_unique(struct dentry *, struct inode *);
213 extern void d_delete(struct dentry *);
215 /* allocate/de-allocate */
216 extern struct dentry * d_alloc(struct dentry *, const struct qstr *);
217 extern struct dentry * d_alloc_anon(struct inode *);
218 extern struct dentry * d_splice_alias(struct inode *, struct dentry *);
219 extern void shrink_dcache_sb(struct super_block *);
220 extern void shrink_dcache_parent(struct dentry *);
221 extern void shrink_dcache_anon(struct hlist_head *);
222 extern int d_invalidate(struct dentry *);
223 extern void flush_dentry_attributes(void);
225 /* only used at mount-time */
226 extern struct dentry * d_alloc_root(struct inode *);
228 /* <clickety>-<click> the ramfs-type tree */
229 extern void d_genocide(struct dentry *);
231 extern struct dentry *d_find_alias(struct inode *);
232 extern void d_prune_aliases(struct inode *);
234 /* test whether we have any submounts in a subdir tree */
235 extern int have_submounts(struct dentry *);
238 * This adds the entry to the hash queues.
240 extern void d_rehash(struct dentry *);
243 * d_add - add dentry to hash queues
244 * @entry: dentry to add
245 * @inode: The inode to attach to this dentry
247 * This adds the entry to the hash queues and initializes @inode.
248 * The entry was actually filled in earlier during d_alloc().
251 static inline void d_add(struct dentry *entry, struct inode *inode)
253 d_instantiate(entry, inode);
258 * d_add_unique - add dentry to hash queues without aliasing
259 * @entry: dentry to add
260 * @inode: The inode to attach to this dentry
262 * This adds the entry to the hash queues and initializes @inode.
263 * The entry was actually filled in earlier during d_alloc().
265 static inline struct dentry *d_add_unique(struct dentry *entry, struct inode *inode)
269 res = d_instantiate_unique(entry, inode);
270 d_rehash(res != NULL ? res : entry);
274 /* used for rename() and baskets */
275 extern void d_move(struct dentry *, struct dentry *);
277 /* appendix may either be NULL or be used for transname suffixes */
278 extern struct dentry * d_lookup(struct dentry *, struct qstr *);
279 extern struct dentry * __d_lookup(struct dentry *, struct qstr *);
280 extern struct dentry * d_hash_and_lookup(struct dentry *, struct qstr *);
282 /* validate "insecure" dentry pointer */
283 extern int d_validate(struct dentry *, struct dentry *);
285 char * __d_path( struct dentry *dentry, struct vfsmount *vfsmnt,
286 struct dentry *root, struct vfsmount *rootmnt,
287 char *buffer, int buflen);
289 extern char * d_path(struct dentry *, struct vfsmount *, char *, int);
291 /* Allocation counts.. */
294 * dget, dget_locked - get a reference to a dentry
295 * @dentry: dentry to get a reference to
297 * Given a dentry or %NULL pointer increment the reference count
298 * if appropriate and return the dentry. A dentry will not be
299 * destroyed when it has references. dget() should never be
300 * called for dentries with zero reference counter. For these cases
301 * (preferably none, functions in dcache.c are sufficient for normal
302 * needs and they take necessary precautions) you should hold dcache_lock
303 * and call dget_locked() instead of dget().
306 static inline struct dentry *dget(struct dentry *dentry)
309 BUG_ON(!atomic_read(&dentry->d_count));
310 atomic_inc(&dentry->d_count);
315 extern struct dentry * dget_locked(struct dentry *);
318 * d_unhashed - is dentry hashed
319 * @dentry: entry to check
321 * Returns true if the dentry passed is not currently hashed.
324 static inline int d_unhashed(struct dentry *dentry)
326 return (dentry->d_flags & DCACHE_UNHASHED);
329 static inline struct dentry *dget_parent(struct dentry *dentry)
333 spin_lock(&dentry->d_lock);
334 ret = dget(dentry->d_parent);
335 spin_unlock(&dentry->d_lock);
339 extern void dput(struct dentry *);
341 static inline int d_mountpoint(struct dentry *dentry)
343 return dentry->d_mounted;
346 extern struct vfsmount *lookup_mnt(struct vfsmount *, struct dentry *);
347 extern struct vfsmount *__lookup_mnt(struct vfsmount *, struct dentry *, int);
348 extern struct dentry *lookup_create(struct nameidata *nd, int is_dir);
350 extern int sysctl_vfs_cache_pressure;
352 #endif /* __KERNEL__ */
354 #endif /* __LINUX_DCACHE_H */