4 * Complete reimplementation
5 * (C) 1997 Thomas Schoebel-Theuer,
6 * with heavy changes by Linus Torvalds
10 * Notes on the allocation strategy:
12 * The dcache is a master of the icache - whenever a dcache entry
13 * exists, the inode will always exist. "iput()" is done either when
14 * the dcache entry is deleted or garbage collected.
17 #include <linux/syscalls.h>
18 #include <linux/string.h>
21 #include <linux/fsnotify.h>
22 #include <linux/slab.h>
23 #include <linux/init.h>
24 #include <linux/hash.h>
25 #include <linux/cache.h>
26 #include <linux/module.h>
27 #include <linux/mount.h>
28 #include <linux/file.h>
29 #include <asm/uaccess.h>
30 #include <linux/security.h>
31 #include <linux/seqlock.h>
32 #include <linux/swap.h>
33 #include <linux/bootmem.h>
34 #include <linux/fs_struct.h>
35 #include <linux/hardirq.h>
36 #include <linux/bit_spinlock.h>
37 #include <linux/rculist_bl.h>
38 #include <linux/prefetch.h>
43 * dcache->d_inode->i_lock protects:
44 * - i_dentry, d_alias, d_inode of aliases
45 * dcache_hash_bucket lock protects:
46 * - the dcache hash table
47 * s_anon bl list spinlock protects:
48 * - the s_anon list (see __d_drop)
49 * dcache_lru_lock protects:
50 * - the dcache lru lists and counters
57 * - d_parent and d_subdirs
58 * - childrens' d_child and d_parent
62 * dentry->d_inode->i_lock
65 * dcache_hash_bucket lock
68 * If there is an ancestor relationship:
69 * dentry->d_parent->...->d_parent->d_lock
71 * dentry->d_parent->d_lock
74 * If no ancestor relationship:
75 * if (dentry1 < dentry2)
79 int sysctl_vfs_cache_pressure __read_mostly = 100;
80 EXPORT_SYMBOL_GPL(sysctl_vfs_cache_pressure);
82 static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_lru_lock);
83 __cacheline_aligned_in_smp DEFINE_SEQLOCK(rename_lock);
85 EXPORT_SYMBOL(rename_lock);
87 static struct kmem_cache *dentry_cache __read_mostly;
90 * This is the single most critical data structure when it comes
91 * to the dcache: the hashtable for lookups. Somebody should try
92 * to make this good - I've just made it work.
94 * This hash-function tries to avoid losing too many bits of hash
95 * information, yet avoid using a prime hash-size or similar.
97 #define D_HASHBITS d_hash_shift
98 #define D_HASHMASK d_hash_mask
100 static unsigned int d_hash_mask __read_mostly;
101 static unsigned int d_hash_shift __read_mostly;
103 static struct hlist_bl_head *dentry_hashtable __read_mostly;
105 static inline struct hlist_bl_head *d_hash(struct dentry *parent,
108 hash += ((unsigned long) parent ^ GOLDEN_RATIO_PRIME) / L1_CACHE_BYTES;
109 hash = hash ^ ((hash ^ GOLDEN_RATIO_PRIME) >> D_HASHBITS);
110 return dentry_hashtable + (hash & D_HASHMASK);
113 /* Statistics gathering. */
114 struct dentry_stat_t dentry_stat = {
118 static DEFINE_PER_CPU(unsigned int, nr_dentry);
120 #if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
121 static int get_nr_dentry(void)
125 for_each_possible_cpu(i)
126 sum += per_cpu(nr_dentry, i);
127 return sum < 0 ? 0 : sum;
130 int proc_nr_dentry(ctl_table *table, int write, void __user *buffer,
131 size_t *lenp, loff_t *ppos)
133 dentry_stat.nr_dentry = get_nr_dentry();
134 return proc_dointvec(table, write, buffer, lenp, ppos);
138 static void __d_free(struct rcu_head *head)
140 struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu);
142 WARN_ON(!list_empty(&dentry->d_alias));
143 if (dname_external(dentry))
144 kfree(dentry->d_name.name);
145 kmem_cache_free(dentry_cache, dentry);
151 static void d_free(struct dentry *dentry)
153 BUG_ON(dentry->d_count);
154 this_cpu_dec(nr_dentry);
155 if (dentry->d_op && dentry->d_op->d_release)
156 dentry->d_op->d_release(dentry);
158 /* if dentry was never visible to RCU, immediate free is OK */
159 if (!(dentry->d_flags & DCACHE_RCUACCESS))
160 __d_free(&dentry->d_u.d_rcu);
162 call_rcu(&dentry->d_u.d_rcu, __d_free);
166 * dentry_rcuwalk_barrier - invalidate in-progress rcu-walk lookups
167 * @dentry: the target dentry
168 * After this call, in-progress rcu-walk path lookup will fail. This
169 * should be called after unhashing, and after changing d_inode (if
170 * the dentry has not already been unhashed).
172 static inline void dentry_rcuwalk_barrier(struct dentry *dentry)
174 assert_spin_locked(&dentry->d_lock);
175 /* Go through a barrier */
176 write_seqcount_barrier(&dentry->d_seq);
180 * Release the dentry's inode, using the filesystem
181 * d_iput() operation if defined. Dentry has no refcount
184 static void dentry_iput(struct dentry * dentry)
185 __releases(dentry->d_lock)
186 __releases(dentry->d_inode->i_lock)
188 struct inode *inode = dentry->d_inode;
190 dentry->d_inode = NULL;
191 list_del_init(&dentry->d_alias);
192 spin_unlock(&dentry->d_lock);
193 spin_unlock(&inode->i_lock);
195 fsnotify_inoderemove(inode);
196 if (dentry->d_op && dentry->d_op->d_iput)
197 dentry->d_op->d_iput(dentry, inode);
201 spin_unlock(&dentry->d_lock);
206 * Release the dentry's inode, using the filesystem
207 * d_iput() operation if defined. dentry remains in-use.
209 static void dentry_unlink_inode(struct dentry * dentry)
210 __releases(dentry->d_lock)
211 __releases(dentry->d_inode->i_lock)
213 struct inode *inode = dentry->d_inode;
214 dentry->d_inode = NULL;
215 list_del_init(&dentry->d_alias);
216 dentry_rcuwalk_barrier(dentry);
217 spin_unlock(&dentry->d_lock);
218 spin_unlock(&inode->i_lock);
220 fsnotify_inoderemove(inode);
221 if (dentry->d_op && dentry->d_op->d_iput)
222 dentry->d_op->d_iput(dentry, inode);
228 * dentry_lru_(add|del|move_tail) must be called with d_lock held.
230 static void dentry_lru_add(struct dentry *dentry)
232 if (list_empty(&dentry->d_lru)) {
233 spin_lock(&dcache_lru_lock);
234 list_add(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
235 dentry->d_sb->s_nr_dentry_unused++;
236 dentry_stat.nr_unused++;
237 spin_unlock(&dcache_lru_lock);
241 static void __dentry_lru_del(struct dentry *dentry)
243 list_del_init(&dentry->d_lru);
244 dentry->d_sb->s_nr_dentry_unused--;
245 dentry_stat.nr_unused--;
248 static void dentry_lru_del(struct dentry *dentry)
250 if (!list_empty(&dentry->d_lru)) {
251 spin_lock(&dcache_lru_lock);
252 __dentry_lru_del(dentry);
253 spin_unlock(&dcache_lru_lock);
257 static void dentry_lru_move_tail(struct dentry *dentry)
259 spin_lock(&dcache_lru_lock);
260 if (list_empty(&dentry->d_lru)) {
261 list_add_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
262 dentry->d_sb->s_nr_dentry_unused++;
263 dentry_stat.nr_unused++;
265 list_move_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
267 spin_unlock(&dcache_lru_lock);
271 * d_kill - kill dentry and return parent
272 * @dentry: dentry to kill
273 * @parent: parent dentry
275 * The dentry must already be unhashed and removed from the LRU.
277 * If this is the root of the dentry tree, return NULL.
279 * dentry->d_lock and parent->d_lock must be held by caller, and are dropped by
282 static struct dentry *d_kill(struct dentry *dentry, struct dentry *parent)
283 __releases(dentry->d_lock)
284 __releases(parent->d_lock)
285 __releases(dentry->d_inode->i_lock)
287 list_del(&dentry->d_u.d_child);
289 * Inform try_to_ascend() that we are no longer attached to the
292 dentry->d_flags |= DCACHE_DISCONNECTED;
294 spin_unlock(&parent->d_lock);
297 * dentry_iput drops the locks, at which point nobody (except
298 * transient RCU lookups) can reach this dentry.
305 * d_drop - drop a dentry
306 * @dentry: dentry to drop
308 * d_drop() unhashes the entry from the parent dentry hashes, so that it won't
309 * be found through a VFS lookup any more. Note that this is different from
310 * deleting the dentry - d_delete will try to mark the dentry negative if
311 * possible, giving a successful _negative_ lookup, while d_drop will
312 * just make the cache lookup fail.
314 * d_drop() is used mainly for stuff that wants to invalidate a dentry for some
315 * reason (NFS timeouts or autofs deletes).
317 * __d_drop requires dentry->d_lock.
319 void __d_drop(struct dentry *dentry)
321 if (!d_unhashed(dentry)) {
322 struct hlist_bl_head *b;
323 if (unlikely(dentry->d_flags & DCACHE_DISCONNECTED))
324 b = &dentry->d_sb->s_anon;
326 b = d_hash(dentry->d_parent, dentry->d_name.hash);
329 __hlist_bl_del(&dentry->d_hash);
330 dentry->d_hash.pprev = NULL;
333 dentry_rcuwalk_barrier(dentry);
336 EXPORT_SYMBOL(__d_drop);
338 void d_drop(struct dentry *dentry)
340 spin_lock(&dentry->d_lock);
342 spin_unlock(&dentry->d_lock);
344 EXPORT_SYMBOL(d_drop);
347 * d_clear_need_lookup - drop a dentry from cache and clear the need lookup flag
348 * @dentry: dentry to drop
350 * This is called when we do a lookup on a placeholder dentry that needed to be
351 * looked up. The dentry should have been hashed in order for it to be found by
352 * the lookup code, but now needs to be unhashed while we do the actual lookup
353 * and clear the DCACHE_NEED_LOOKUP flag.
355 void d_clear_need_lookup(struct dentry *dentry)
357 spin_lock(&dentry->d_lock);
359 dentry->d_flags &= ~DCACHE_NEED_LOOKUP;
360 spin_unlock(&dentry->d_lock);
362 EXPORT_SYMBOL(d_clear_need_lookup);
365 * Finish off a dentry we've decided to kill.
366 * dentry->d_lock must be held, returns with it unlocked.
367 * If ref is non-zero, then decrement the refcount too.
368 * Returns dentry requiring refcount drop, or NULL if we're done.
370 static inline struct dentry *dentry_kill(struct dentry *dentry, int ref)
371 __releases(dentry->d_lock)
374 struct dentry *parent;
376 inode = dentry->d_inode;
377 if (inode && !spin_trylock(&inode->i_lock)) {
379 spin_unlock(&dentry->d_lock);
381 return dentry; /* try again with same dentry */
386 parent = dentry->d_parent;
387 if (parent && !spin_trylock(&parent->d_lock)) {
389 spin_unlock(&inode->i_lock);
395 /* if dentry was on the d_lru list delete it from there */
396 dentry_lru_del(dentry);
397 /* if it was on the hash then remove it */
399 return d_kill(dentry, parent);
405 * This is complicated by the fact that we do not want to put
406 * dentries that are no longer on any hash chain on the unused
407 * list: we'd much rather just get rid of them immediately.
409 * However, that implies that we have to traverse the dentry
410 * tree upwards to the parents which might _also_ now be
411 * scheduled for deletion (it may have been only waiting for
412 * its last child to go away).
414 * This tail recursion is done by hand as we don't want to depend
415 * on the compiler to always get this right (gcc generally doesn't).
416 * Real recursion would eat up our stack space.
420 * dput - release a dentry
421 * @dentry: dentry to release
423 * Release a dentry. This will drop the usage count and if appropriate
424 * call the dentry unlink method as well as removing it from the queues and
425 * releasing its resources. If the parent dentries were scheduled for release
426 * they too may now get deleted.
428 void dput(struct dentry *dentry)
434 if (dentry->d_count == 1)
436 spin_lock(&dentry->d_lock);
437 BUG_ON(!dentry->d_count);
438 if (dentry->d_count > 1) {
440 spin_unlock(&dentry->d_lock);
444 if (dentry->d_flags & DCACHE_OP_DELETE) {
445 if (dentry->d_op->d_delete(dentry))
449 /* Unreachable? Get rid of it */
450 if (d_unhashed(dentry))
454 * If this dentry needs lookup, don't set the referenced flag so that it
455 * is more likely to be cleaned up by the dcache shrinker in case of
458 if (!d_need_lookup(dentry))
459 dentry->d_flags |= DCACHE_REFERENCED;
460 dentry_lru_add(dentry);
463 spin_unlock(&dentry->d_lock);
467 dentry = dentry_kill(dentry, 1);
474 * d_invalidate - invalidate a dentry
475 * @dentry: dentry to invalidate
477 * Try to invalidate the dentry if it turns out to be
478 * possible. If there are other dentries that can be
479 * reached through this one we can't delete it and we
480 * return -EBUSY. On success we return 0.
485 int d_invalidate(struct dentry * dentry)
488 * If it's already been dropped, return OK.
490 spin_lock(&dentry->d_lock);
491 if (d_unhashed(dentry)) {
492 spin_unlock(&dentry->d_lock);
496 * Check whether to do a partial shrink_dcache
497 * to get rid of unused child entries.
499 if (!list_empty(&dentry->d_subdirs)) {
500 spin_unlock(&dentry->d_lock);
501 shrink_dcache_parent(dentry);
502 spin_lock(&dentry->d_lock);
506 * Somebody else still using it?
508 * If it's a directory, we can't drop it
509 * for fear of somebody re-populating it
510 * with children (even though dropping it
511 * would make it unreachable from the root,
512 * we might still populate it if it was a
513 * working directory or similar).
515 if (dentry->d_count > 1) {
516 if (dentry->d_inode && S_ISDIR(dentry->d_inode->i_mode)) {
517 spin_unlock(&dentry->d_lock);
523 spin_unlock(&dentry->d_lock);
526 EXPORT_SYMBOL(d_invalidate);
528 /* This must be called with d_lock held */
529 static inline void __dget_dlock(struct dentry *dentry)
534 static inline void __dget(struct dentry *dentry)
536 spin_lock(&dentry->d_lock);
537 __dget_dlock(dentry);
538 spin_unlock(&dentry->d_lock);
541 struct dentry *dget_parent(struct dentry *dentry)
547 * Don't need rcu_dereference because we re-check it was correct under
551 ret = dentry->d_parent;
556 spin_lock(&ret->d_lock);
557 if (unlikely(ret != dentry->d_parent)) {
558 spin_unlock(&ret->d_lock);
563 BUG_ON(!ret->d_count);
565 spin_unlock(&ret->d_lock);
569 EXPORT_SYMBOL(dget_parent);
572 * d_find_alias - grab a hashed alias of inode
573 * @inode: inode in question
574 * @want_discon: flag, used by d_splice_alias, to request
575 * that only a DISCONNECTED alias be returned.
577 * If inode has a hashed alias, or is a directory and has any alias,
578 * acquire the reference to alias and return it. Otherwise return NULL.
579 * Notice that if inode is a directory there can be only one alias and
580 * it can be unhashed only if it has no children, or if it is the root
583 * If the inode has an IS_ROOT, DCACHE_DISCONNECTED alias, then prefer
584 * any other hashed alias over that one unless @want_discon is set,
585 * in which case only return an IS_ROOT, DCACHE_DISCONNECTED alias.
587 static struct dentry *__d_find_alias(struct inode *inode, int want_discon)
589 struct dentry *alias, *discon_alias;
593 list_for_each_entry(alias, &inode->i_dentry, d_alias) {
594 spin_lock(&alias->d_lock);
595 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
596 if (IS_ROOT(alias) &&
597 (alias->d_flags & DCACHE_DISCONNECTED)) {
598 discon_alias = alias;
599 } else if (!want_discon) {
601 spin_unlock(&alias->d_lock);
605 spin_unlock(&alias->d_lock);
608 alias = discon_alias;
609 spin_lock(&alias->d_lock);
610 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
611 if (IS_ROOT(alias) &&
612 (alias->d_flags & DCACHE_DISCONNECTED)) {
614 spin_unlock(&alias->d_lock);
618 spin_unlock(&alias->d_lock);
624 struct dentry *d_find_alias(struct inode *inode)
626 struct dentry *de = NULL;
628 if (!list_empty(&inode->i_dentry)) {
629 spin_lock(&inode->i_lock);
630 de = __d_find_alias(inode, 0);
631 spin_unlock(&inode->i_lock);
635 EXPORT_SYMBOL(d_find_alias);
638 * Try to kill dentries associated with this inode.
639 * WARNING: you must own a reference to inode.
641 void d_prune_aliases(struct inode *inode)
643 struct dentry *dentry;
645 spin_lock(&inode->i_lock);
646 list_for_each_entry(dentry, &inode->i_dentry, d_alias) {
647 spin_lock(&dentry->d_lock);
648 if (!dentry->d_count) {
649 __dget_dlock(dentry);
651 spin_unlock(&dentry->d_lock);
652 spin_unlock(&inode->i_lock);
656 spin_unlock(&dentry->d_lock);
658 spin_unlock(&inode->i_lock);
660 EXPORT_SYMBOL(d_prune_aliases);
663 * Try to throw away a dentry - free the inode, dput the parent.
664 * Requires dentry->d_lock is held, and dentry->d_count == 0.
665 * Releases dentry->d_lock.
667 * This may fail if locks cannot be acquired no problem, just try again.
669 static void try_prune_one_dentry(struct dentry *dentry)
670 __releases(dentry->d_lock)
672 struct dentry *parent;
674 parent = dentry_kill(dentry, 0);
676 * If dentry_kill returns NULL, we have nothing more to do.
677 * if it returns the same dentry, trylocks failed. In either
678 * case, just loop again.
680 * Otherwise, we need to prune ancestors too. This is necessary
681 * to prevent quadratic behavior of shrink_dcache_parent(), but
682 * is also expected to be beneficial in reducing dentry cache
687 if (parent == dentry)
690 /* Prune ancestors. */
693 spin_lock(&dentry->d_lock);
694 if (dentry->d_count > 1) {
696 spin_unlock(&dentry->d_lock);
699 dentry = dentry_kill(dentry, 1);
703 static void shrink_dentry_list(struct list_head *list)
705 struct dentry *dentry;
709 dentry = list_entry_rcu(list->prev, struct dentry, d_lru);
710 if (&dentry->d_lru == list)
712 spin_lock(&dentry->d_lock);
713 if (dentry != list_entry(list->prev, struct dentry, d_lru)) {
714 spin_unlock(&dentry->d_lock);
719 * We found an inuse dentry which was not removed from
720 * the LRU because of laziness during lookup. Do not free
721 * it - just keep it off the LRU list.
723 if (dentry->d_count) {
724 dentry_lru_del(dentry);
725 spin_unlock(&dentry->d_lock);
731 try_prune_one_dentry(dentry);
739 * __shrink_dcache_sb - shrink the dentry LRU on a given superblock
740 * @sb: superblock to shrink dentry LRU.
741 * @count: number of entries to prune
742 * @flags: flags to control the dentry processing
744 * If flags contains DCACHE_REFERENCED reference dentries will not be pruned.
746 static void __shrink_dcache_sb(struct super_block *sb, int *count, int flags)
748 /* called from prune_dcache() and shrink_dcache_parent() */
749 struct dentry *dentry;
750 LIST_HEAD(referenced);
755 spin_lock(&dcache_lru_lock);
756 while (!list_empty(&sb->s_dentry_lru)) {
757 dentry = list_entry(sb->s_dentry_lru.prev,
758 struct dentry, d_lru);
759 BUG_ON(dentry->d_sb != sb);
761 if (!spin_trylock(&dentry->d_lock)) {
762 spin_unlock(&dcache_lru_lock);
768 * If we are honouring the DCACHE_REFERENCED flag and the
769 * dentry has this flag set, don't free it. Clear the flag
770 * and put it back on the LRU.
772 if (flags & DCACHE_REFERENCED &&
773 dentry->d_flags & DCACHE_REFERENCED) {
774 dentry->d_flags &= ~DCACHE_REFERENCED;
775 list_move(&dentry->d_lru, &referenced);
776 spin_unlock(&dentry->d_lock);
778 list_move_tail(&dentry->d_lru, &tmp);
779 spin_unlock(&dentry->d_lock);
783 cond_resched_lock(&dcache_lru_lock);
785 if (!list_empty(&referenced))
786 list_splice(&referenced, &sb->s_dentry_lru);
787 spin_unlock(&dcache_lru_lock);
789 shrink_dentry_list(&tmp);
795 * prune_dcache - shrink the dcache
796 * @count: number of entries to try to free
798 * Shrink the dcache. This is done when we need more memory, or simply when we
799 * need to unmount something (at which point we need to unuse all dentries).
801 * This function may fail to free any resources if all the dentries are in use.
803 static void prune_dcache(int count)
805 struct super_block *sb, *p = NULL;
807 int unused = dentry_stat.nr_unused;
811 if (unused == 0 || count == 0)
816 prune_ratio = unused / count;
818 list_for_each_entry(sb, &super_blocks, s_list) {
819 if (list_empty(&sb->s_instances))
821 if (sb->s_nr_dentry_unused == 0)
824 /* Now, we reclaim unused dentrins with fairness.
825 * We reclaim them same percentage from each superblock.
826 * We calculate number of dentries to scan on this sb
827 * as follows, but the implementation is arranged to avoid
829 * number of dentries to scan on this sb =
830 * count * (number of dentries on this sb /
831 * number of dentries in the machine)
833 spin_unlock(&sb_lock);
834 if (prune_ratio != 1)
835 w_count = (sb->s_nr_dentry_unused / prune_ratio) + 1;
837 w_count = sb->s_nr_dentry_unused;
840 * We need to be sure this filesystem isn't being unmounted,
841 * otherwise we could race with generic_shutdown_super(), and
842 * end up holding a reference to an inode while the filesystem
843 * is unmounted. So we try to get s_umount, and make sure
846 if (down_read_trylock(&sb->s_umount)) {
847 if ((sb->s_root != NULL) &&
848 (!list_empty(&sb->s_dentry_lru))) {
849 __shrink_dcache_sb(sb, &w_count,
853 up_read(&sb->s_umount);
860 /* more work left to do? */
866 spin_unlock(&sb_lock);
870 * shrink_dcache_sb - shrink dcache for a superblock
873 * Shrink the dcache for the specified super block. This is used to free
874 * the dcache before unmounting a file system.
876 void shrink_dcache_sb(struct super_block *sb)
880 spin_lock(&dcache_lru_lock);
881 while (!list_empty(&sb->s_dentry_lru)) {
882 list_splice_init(&sb->s_dentry_lru, &tmp);
883 spin_unlock(&dcache_lru_lock);
884 shrink_dentry_list(&tmp);
885 spin_lock(&dcache_lru_lock);
887 spin_unlock(&dcache_lru_lock);
889 EXPORT_SYMBOL(shrink_dcache_sb);
892 * destroy a single subtree of dentries for unmount
893 * - see the comments on shrink_dcache_for_umount() for a description of the
896 static void shrink_dcache_for_umount_subtree(struct dentry *dentry)
898 struct dentry *parent;
899 unsigned detached = 0;
901 BUG_ON(!IS_ROOT(dentry));
903 /* detach this root from the system */
904 spin_lock(&dentry->d_lock);
905 dentry_lru_del(dentry);
907 spin_unlock(&dentry->d_lock);
910 /* descend to the first leaf in the current subtree */
911 while (!list_empty(&dentry->d_subdirs)) {
914 /* this is a branch with children - detach all of them
915 * from the system in one go */
916 spin_lock(&dentry->d_lock);
917 list_for_each_entry(loop, &dentry->d_subdirs,
919 spin_lock_nested(&loop->d_lock,
920 DENTRY_D_LOCK_NESTED);
921 dentry_lru_del(loop);
923 spin_unlock(&loop->d_lock);
925 spin_unlock(&dentry->d_lock);
927 /* move to the first child */
928 dentry = list_entry(dentry->d_subdirs.next,
929 struct dentry, d_u.d_child);
932 /* consume the dentries from this leaf up through its parents
933 * until we find one with children or run out altogether */
937 if (dentry->d_count != 0) {
939 "BUG: Dentry %p{i=%lx,n=%s}"
941 " [unmount of %s %s]\n",
944 dentry->d_inode->i_ino : 0UL,
947 dentry->d_sb->s_type->name,
952 if (IS_ROOT(dentry)) {
954 list_del(&dentry->d_u.d_child);
956 parent = dentry->d_parent;
957 spin_lock(&parent->d_lock);
959 list_del(&dentry->d_u.d_child);
960 spin_unlock(&parent->d_lock);
965 inode = dentry->d_inode;
967 dentry->d_inode = NULL;
968 list_del_init(&dentry->d_alias);
969 if (dentry->d_op && dentry->d_op->d_iput)
970 dentry->d_op->d_iput(dentry, inode);
977 /* finished when we fall off the top of the tree,
978 * otherwise we ascend to the parent and move to the
979 * next sibling if there is one */
983 } while (list_empty(&dentry->d_subdirs));
985 dentry = list_entry(dentry->d_subdirs.next,
986 struct dentry, d_u.d_child);
991 * destroy the dentries attached to a superblock on unmounting
992 * - we don't need to use dentry->d_lock because:
993 * - the superblock is detached from all mountings and open files, so the
994 * dentry trees will not be rearranged by the VFS
995 * - s_umount is write-locked, so the memory pressure shrinker will ignore
996 * any dentries belonging to this superblock that it comes across
997 * - the filesystem itself is no longer permitted to rearrange the dentries
1000 void shrink_dcache_for_umount(struct super_block *sb)
1002 struct dentry *dentry;
1004 if (down_read_trylock(&sb->s_umount))
1007 dentry = sb->s_root;
1009 spin_lock(&dentry->d_lock);
1011 spin_unlock(&dentry->d_lock);
1012 shrink_dcache_for_umount_subtree(dentry);
1014 while (!hlist_bl_empty(&sb->s_anon)) {
1015 dentry = hlist_bl_entry(hlist_bl_first(&sb->s_anon), struct dentry, d_hash);
1016 shrink_dcache_for_umount_subtree(dentry);
1021 * This tries to ascend one level of parenthood, but
1022 * we can race with renaming, so we need to re-check
1023 * the parenthood after dropping the lock and check
1024 * that the sequence number still matches.
1026 static struct dentry *try_to_ascend(struct dentry *old, int locked, unsigned seq)
1028 struct dentry *new = old->d_parent;
1031 spin_unlock(&old->d_lock);
1032 spin_lock(&new->d_lock);
1035 * might go back up the wrong parent if we have had a rename
1038 if (new != old->d_parent ||
1039 (old->d_flags & DCACHE_DISCONNECTED) ||
1040 (!locked && read_seqretry(&rename_lock, seq))) {
1041 spin_unlock(&new->d_lock);
1050 * Search for at least 1 mount point in the dentry's subdirs.
1051 * We descend to the next level whenever the d_subdirs
1052 * list is non-empty and continue searching.
1056 * have_submounts - check for mounts over a dentry
1057 * @parent: dentry to check.
1059 * Return true if the parent or its subdirectories contain
1062 int have_submounts(struct dentry *parent)
1064 struct dentry *this_parent;
1065 struct list_head *next;
1069 seq = read_seqbegin(&rename_lock);
1071 this_parent = parent;
1073 if (d_mountpoint(parent))
1075 spin_lock(&this_parent->d_lock);
1077 next = this_parent->d_subdirs.next;
1079 while (next != &this_parent->d_subdirs) {
1080 struct list_head *tmp = next;
1081 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
1084 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
1085 /* Have we found a mount point ? */
1086 if (d_mountpoint(dentry)) {
1087 spin_unlock(&dentry->d_lock);
1088 spin_unlock(&this_parent->d_lock);
1091 if (!list_empty(&dentry->d_subdirs)) {
1092 spin_unlock(&this_parent->d_lock);
1093 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
1094 this_parent = dentry;
1095 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
1098 spin_unlock(&dentry->d_lock);
1101 * All done at this level ... ascend and resume the search.
1103 if (this_parent != parent) {
1104 struct dentry *child = this_parent;
1105 this_parent = try_to_ascend(this_parent, locked, seq);
1108 next = child->d_u.d_child.next;
1111 spin_unlock(&this_parent->d_lock);
1112 if (!locked && read_seqretry(&rename_lock, seq))
1115 write_sequnlock(&rename_lock);
1116 return 0; /* No mount points found in tree */
1118 if (!locked && read_seqretry(&rename_lock, seq))
1121 write_sequnlock(&rename_lock);
1126 write_seqlock(&rename_lock);
1129 EXPORT_SYMBOL(have_submounts);
1132 * Search the dentry child list for the specified parent,
1133 * and move any unused dentries to the end of the unused
1134 * list for prune_dcache(). We descend to the next level
1135 * whenever the d_subdirs list is non-empty and continue
1138 * It returns zero iff there are no unused children,
1139 * otherwise it returns the number of children moved to
1140 * the end of the unused list. This may not be the total
1141 * number of unused children, because select_parent can
1142 * drop the lock and return early due to latency
1145 static int select_parent(struct dentry * parent)
1147 struct dentry *this_parent;
1148 struct list_head *next;
1153 seq = read_seqbegin(&rename_lock);
1155 this_parent = parent;
1156 spin_lock(&this_parent->d_lock);
1158 next = this_parent->d_subdirs.next;
1160 while (next != &this_parent->d_subdirs) {
1161 struct list_head *tmp = next;
1162 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
1165 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
1168 * move only zero ref count dentries to the end
1169 * of the unused list for prune_dcache
1171 if (!dentry->d_count) {
1172 dentry_lru_move_tail(dentry);
1175 dentry_lru_del(dentry);
1179 * We can return to the caller if we have found some (this
1180 * ensures forward progress). We'll be coming back to find
1183 if (found && need_resched()) {
1184 spin_unlock(&dentry->d_lock);
1189 * Descend a level if the d_subdirs list is non-empty.
1191 if (!list_empty(&dentry->d_subdirs)) {
1192 spin_unlock(&this_parent->d_lock);
1193 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
1194 this_parent = dentry;
1195 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
1199 spin_unlock(&dentry->d_lock);
1202 * All done at this level ... ascend and resume the search.
1204 if (this_parent != parent) {
1205 struct dentry *child = this_parent;
1206 this_parent = try_to_ascend(this_parent, locked, seq);
1209 next = child->d_u.d_child.next;
1213 spin_unlock(&this_parent->d_lock);
1214 if (!locked && read_seqretry(&rename_lock, seq))
1217 write_sequnlock(&rename_lock);
1224 write_seqlock(&rename_lock);
1229 * shrink_dcache_parent - prune dcache
1230 * @parent: parent of entries to prune
1232 * Prune the dcache to remove unused children of the parent dentry.
1235 void shrink_dcache_parent(struct dentry * parent)
1237 struct super_block *sb = parent->d_sb;
1240 while ((found = select_parent(parent)) != 0)
1241 __shrink_dcache_sb(sb, &found, 0);
1243 EXPORT_SYMBOL(shrink_dcache_parent);
1246 * Scan `sc->nr_slab_to_reclaim' dentries and return the number which remain.
1248 * We need to avoid reentering the filesystem if the caller is performing a
1249 * GFP_NOFS allocation attempt. One example deadlock is:
1251 * ext2_new_block->getblk->GFP->shrink_dcache_memory->prune_dcache->
1252 * prune_one_dentry->dput->dentry_iput->iput->inode->i_sb->s_op->put_inode->
1253 * ext2_discard_prealloc->ext2_free_blocks->lock_super->DEADLOCK.
1255 * In this case we return -1 to tell the caller that we baled.
1257 static int shrink_dcache_memory(struct shrinker *shrink,
1258 struct shrink_control *sc)
1260 int nr = sc->nr_to_scan;
1261 gfp_t gfp_mask = sc->gfp_mask;
1264 if (!(gfp_mask & __GFP_FS))
1269 return (dentry_stat.nr_unused / 100) * sysctl_vfs_cache_pressure;
1272 static struct shrinker dcache_shrinker = {
1273 .shrink = shrink_dcache_memory,
1274 .seeks = DEFAULT_SEEKS,
1278 * __d_alloc - allocate a dcache entry
1279 * @sb: filesystem it will belong to
1280 * @name: qstr of the name
1282 * Allocates a dentry. It returns %NULL if there is insufficient memory
1283 * available. On a success the dentry is returned. The name passed in is
1284 * copied and the copy passed in may be reused after this call.
1287 struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name)
1289 struct dentry *dentry;
1292 dentry = kmem_cache_alloc(dentry_cache, GFP_KERNEL);
1296 if (name->len > DNAME_INLINE_LEN-1) {
1297 dname = kmalloc(name->len + 1, GFP_KERNEL);
1299 kmem_cache_free(dentry_cache, dentry);
1303 dname = dentry->d_iname;
1305 dentry->d_name.name = dname;
1307 dentry->d_name.len = name->len;
1308 dentry->d_name.hash = name->hash;
1309 memcpy(dname, name->name, name->len);
1310 dname[name->len] = 0;
1312 dentry->d_count = 1;
1313 dentry->d_flags = 0;
1314 spin_lock_init(&dentry->d_lock);
1315 seqcount_init(&dentry->d_seq);
1316 dentry->d_inode = NULL;
1317 dentry->d_parent = dentry;
1319 dentry->d_op = NULL;
1320 dentry->d_fsdata = NULL;
1321 INIT_HLIST_BL_NODE(&dentry->d_hash);
1322 INIT_LIST_HEAD(&dentry->d_lru);
1323 INIT_LIST_HEAD(&dentry->d_subdirs);
1324 INIT_LIST_HEAD(&dentry->d_alias);
1325 INIT_LIST_HEAD(&dentry->d_u.d_child);
1326 d_set_d_op(dentry, dentry->d_sb->s_d_op);
1328 this_cpu_inc(nr_dentry);
1334 * d_alloc - allocate a dcache entry
1335 * @parent: parent of entry to allocate
1336 * @name: qstr of the name
1338 * Allocates a dentry. It returns %NULL if there is insufficient memory
1339 * available. On a success the dentry is returned. The name passed in is
1340 * copied and the copy passed in may be reused after this call.
1342 struct dentry *d_alloc(struct dentry * parent, const struct qstr *name)
1344 struct dentry *dentry = __d_alloc(parent->d_sb, name);
1348 spin_lock(&parent->d_lock);
1350 * don't need child lock because it is not subject
1351 * to concurrency here
1353 __dget_dlock(parent);
1354 dentry->d_parent = parent;
1355 list_add(&dentry->d_u.d_child, &parent->d_subdirs);
1356 spin_unlock(&parent->d_lock);
1360 EXPORT_SYMBOL(d_alloc);
1362 struct dentry *d_alloc_pseudo(struct super_block *sb, const struct qstr *name)
1364 struct dentry *dentry = __d_alloc(sb, name);
1366 dentry->d_flags |= DCACHE_DISCONNECTED;
1369 EXPORT_SYMBOL(d_alloc_pseudo);
1371 struct dentry *d_alloc_name(struct dentry *parent, const char *name)
1376 q.len = strlen(name);
1377 q.hash = full_name_hash(q.name, q.len);
1378 return d_alloc(parent, &q);
1380 EXPORT_SYMBOL(d_alloc_name);
1382 void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op)
1384 WARN_ON_ONCE(dentry->d_op);
1385 WARN_ON_ONCE(dentry->d_flags & (DCACHE_OP_HASH |
1387 DCACHE_OP_REVALIDATE |
1388 DCACHE_OP_DELETE ));
1393 dentry->d_flags |= DCACHE_OP_HASH;
1395 dentry->d_flags |= DCACHE_OP_COMPARE;
1396 if (op->d_revalidate)
1397 dentry->d_flags |= DCACHE_OP_REVALIDATE;
1399 dentry->d_flags |= DCACHE_OP_DELETE;
1402 EXPORT_SYMBOL(d_set_d_op);
1404 static void __d_instantiate(struct dentry *dentry, struct inode *inode)
1406 spin_lock(&dentry->d_lock);
1408 if (unlikely(IS_AUTOMOUNT(inode)))
1409 dentry->d_flags |= DCACHE_NEED_AUTOMOUNT;
1410 list_add(&dentry->d_alias, &inode->i_dentry);
1412 dentry->d_inode = inode;
1413 dentry_rcuwalk_barrier(dentry);
1414 spin_unlock(&dentry->d_lock);
1415 fsnotify_d_instantiate(dentry, inode);
1419 * d_instantiate - fill in inode information for a dentry
1420 * @entry: dentry to complete
1421 * @inode: inode to attach to this dentry
1423 * Fill in inode information in the entry.
1425 * This turns negative dentries into productive full members
1428 * NOTE! This assumes that the inode count has been incremented
1429 * (or otherwise set) by the caller to indicate that it is now
1430 * in use by the dcache.
1433 void d_instantiate(struct dentry *entry, struct inode * inode)
1435 BUG_ON(!list_empty(&entry->d_alias));
1437 spin_lock(&inode->i_lock);
1438 __d_instantiate(entry, inode);
1440 spin_unlock(&inode->i_lock);
1441 security_d_instantiate(entry, inode);
1443 EXPORT_SYMBOL(d_instantiate);
1446 * d_instantiate_unique - instantiate a non-aliased dentry
1447 * @entry: dentry to instantiate
1448 * @inode: inode to attach to this dentry
1450 * Fill in inode information in the entry. On success, it returns NULL.
1451 * If an unhashed alias of "entry" already exists, then we return the
1452 * aliased dentry instead and drop one reference to inode.
1454 * Note that in order to avoid conflicts with rename() etc, the caller
1455 * had better be holding the parent directory semaphore.
1457 * This also assumes that the inode count has been incremented
1458 * (or otherwise set) by the caller to indicate that it is now
1459 * in use by the dcache.
1461 static struct dentry *__d_instantiate_unique(struct dentry *entry,
1462 struct inode *inode)
1464 struct dentry *alias;
1465 int len = entry->d_name.len;
1466 const char *name = entry->d_name.name;
1467 unsigned int hash = entry->d_name.hash;
1470 __d_instantiate(entry, NULL);
1474 list_for_each_entry(alias, &inode->i_dentry, d_alias) {
1475 struct qstr *qstr = &alias->d_name;
1478 * Don't need alias->d_lock here, because aliases with
1479 * d_parent == entry->d_parent are not subject to name or
1480 * parent changes, because the parent inode i_mutex is held.
1482 if (qstr->hash != hash)
1484 if (alias->d_parent != entry->d_parent)
1486 if (dentry_cmp(qstr->name, qstr->len, name, len))
1492 __d_instantiate(entry, inode);
1496 struct dentry *d_instantiate_unique(struct dentry *entry, struct inode *inode)
1498 struct dentry *result;
1500 BUG_ON(!list_empty(&entry->d_alias));
1503 spin_lock(&inode->i_lock);
1504 result = __d_instantiate_unique(entry, inode);
1506 spin_unlock(&inode->i_lock);
1509 security_d_instantiate(entry, inode);
1513 BUG_ON(!d_unhashed(result));
1518 EXPORT_SYMBOL(d_instantiate_unique);
1521 * d_alloc_root - allocate root dentry
1522 * @root_inode: inode to allocate the root for
1524 * Allocate a root ("/") dentry for the inode given. The inode is
1525 * instantiated and returned. %NULL is returned if there is insufficient
1526 * memory or the inode passed is %NULL.
1529 struct dentry * d_alloc_root(struct inode * root_inode)
1531 struct dentry *res = NULL;
1534 static const struct qstr name = { .name = "/", .len = 1 };
1536 res = __d_alloc(root_inode->i_sb, &name);
1538 d_instantiate(res, root_inode);
1542 EXPORT_SYMBOL(d_alloc_root);
1544 static struct dentry * __d_find_any_alias(struct inode *inode)
1546 struct dentry *alias;
1548 if (list_empty(&inode->i_dentry))
1550 alias = list_first_entry(&inode->i_dentry, struct dentry, d_alias);
1555 static struct dentry * d_find_any_alias(struct inode *inode)
1559 spin_lock(&inode->i_lock);
1560 de = __d_find_any_alias(inode);
1561 spin_unlock(&inode->i_lock);
1567 * d_obtain_alias - find or allocate a dentry for a given inode
1568 * @inode: inode to allocate the dentry for
1570 * Obtain a dentry for an inode resulting from NFS filehandle conversion or
1571 * similar open by handle operations. The returned dentry may be anonymous,
1572 * or may have a full name (if the inode was already in the cache).
1574 * When called on a directory inode, we must ensure that the inode only ever
1575 * has one dentry. If a dentry is found, that is returned instead of
1576 * allocating a new one.
1578 * On successful return, the reference to the inode has been transferred
1579 * to the dentry. In case of an error the reference on the inode is released.
1580 * To make it easier to use in export operations a %NULL or IS_ERR inode may
1581 * be passed in and will be the error will be propagate to the return value,
1582 * with a %NULL @inode replaced by ERR_PTR(-ESTALE).
1584 struct dentry *d_obtain_alias(struct inode *inode)
1586 static const struct qstr anonstring = { .name = "" };
1591 return ERR_PTR(-ESTALE);
1593 return ERR_CAST(inode);
1595 res = d_find_any_alias(inode);
1599 tmp = __d_alloc(inode->i_sb, &anonstring);
1601 res = ERR_PTR(-ENOMEM);
1605 spin_lock(&inode->i_lock);
1606 res = __d_find_any_alias(inode);
1608 spin_unlock(&inode->i_lock);
1613 /* attach a disconnected dentry */
1614 spin_lock(&tmp->d_lock);
1615 tmp->d_inode = inode;
1616 tmp->d_flags |= DCACHE_DISCONNECTED;
1617 list_add(&tmp->d_alias, &inode->i_dentry);
1618 hlist_bl_lock(&tmp->d_sb->s_anon);
1619 hlist_bl_add_head(&tmp->d_hash, &tmp->d_sb->s_anon);
1620 hlist_bl_unlock(&tmp->d_sb->s_anon);
1621 spin_unlock(&tmp->d_lock);
1622 spin_unlock(&inode->i_lock);
1623 security_d_instantiate(tmp, inode);
1628 if (res && !IS_ERR(res))
1629 security_d_instantiate(res, inode);
1633 EXPORT_SYMBOL(d_obtain_alias);
1636 * d_splice_alias - splice a disconnected dentry into the tree if one exists
1637 * @inode: the inode which may have a disconnected dentry
1638 * @dentry: a negative dentry which we want to point to the inode.
1640 * If inode is a directory and has a 'disconnected' dentry (i.e. IS_ROOT and
1641 * DCACHE_DISCONNECTED), then d_move that in place of the given dentry
1642 * and return it, else simply d_add the inode to the dentry and return NULL.
1644 * This is needed in the lookup routine of any filesystem that is exportable
1645 * (via knfsd) so that we can build dcache paths to directories effectively.
1647 * If a dentry was found and moved, then it is returned. Otherwise NULL
1648 * is returned. This matches the expected return value of ->lookup.
1651 struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry)
1653 struct dentry *new = NULL;
1655 if (inode && S_ISDIR(inode->i_mode)) {
1656 spin_lock(&inode->i_lock);
1657 new = __d_find_alias(inode, 1);
1659 BUG_ON(!(new->d_flags & DCACHE_DISCONNECTED));
1660 spin_unlock(&inode->i_lock);
1661 security_d_instantiate(new, inode);
1662 d_move(new, dentry);
1665 /* already taking inode->i_lock, so d_add() by hand */
1666 __d_instantiate(dentry, inode);
1667 spin_unlock(&inode->i_lock);
1668 security_d_instantiate(dentry, inode);
1672 d_add(dentry, inode);
1675 EXPORT_SYMBOL(d_splice_alias);
1678 * d_add_ci - lookup or allocate new dentry with case-exact name
1679 * @inode: the inode case-insensitive lookup has found
1680 * @dentry: the negative dentry that was passed to the parent's lookup func
1681 * @name: the case-exact name to be associated with the returned dentry
1683 * This is to avoid filling the dcache with case-insensitive names to the
1684 * same inode, only the actual correct case is stored in the dcache for
1685 * case-insensitive filesystems.
1687 * For a case-insensitive lookup match and if the the case-exact dentry
1688 * already exists in in the dcache, use it and return it.
1690 * If no entry exists with the exact case name, allocate new dentry with
1691 * the exact case, and return the spliced entry.
1693 struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode,
1697 struct dentry *found;
1701 * First check if a dentry matching the name already exists,
1702 * if not go ahead and create it now.
1704 found = d_hash_and_lookup(dentry->d_parent, name);
1706 new = d_alloc(dentry->d_parent, name);
1712 found = d_splice_alias(inode, new);
1721 * If a matching dentry exists, and it's not negative use it.
1723 * Decrement the reference count to balance the iget() done
1726 if (found->d_inode) {
1727 if (unlikely(found->d_inode != inode)) {
1728 /* This can't happen because bad inodes are unhashed. */
1729 BUG_ON(!is_bad_inode(inode));
1730 BUG_ON(!is_bad_inode(found->d_inode));
1737 * We are going to instantiate this dentry, unhash it and clear the
1738 * lookup flag so we can do that.
1740 if (unlikely(d_need_lookup(found)))
1741 d_clear_need_lookup(found);
1744 * Negative dentry: instantiate it unless the inode is a directory and
1745 * already has a dentry.
1747 spin_lock(&inode->i_lock);
1748 if (!S_ISDIR(inode->i_mode) || list_empty(&inode->i_dentry)) {
1749 __d_instantiate(found, inode);
1750 spin_unlock(&inode->i_lock);
1751 security_d_instantiate(found, inode);
1756 * In case a directory already has a (disconnected) entry grab a
1757 * reference to it, move it in place and use it.
1759 new = list_entry(inode->i_dentry.next, struct dentry, d_alias);
1761 spin_unlock(&inode->i_lock);
1762 security_d_instantiate(found, inode);
1770 return ERR_PTR(error);
1772 EXPORT_SYMBOL(d_add_ci);
1775 * __d_lookup_rcu - search for a dentry (racy, store-free)
1776 * @parent: parent dentry
1777 * @name: qstr of name we wish to find
1778 * @seq: returns d_seq value at the point where the dentry was found
1779 * @inode: returns dentry->d_inode when the inode was found valid.
1780 * Returns: dentry, or NULL
1782 * __d_lookup_rcu is the dcache lookup function for rcu-walk name
1783 * resolution (store-free path walking) design described in
1784 * Documentation/filesystems/path-lookup.txt.
1786 * This is not to be used outside core vfs.
1788 * __d_lookup_rcu must only be used in rcu-walk mode, ie. with vfsmount lock
1789 * held, and rcu_read_lock held. The returned dentry must not be stored into
1790 * without taking d_lock and checking d_seq sequence count against @seq
1793 * A refcount may be taken on the found dentry with the __d_rcu_to_refcount
1796 * Alternatively, __d_lookup_rcu may be called again to look up the child of
1797 * the returned dentry, so long as its parent's seqlock is checked after the
1798 * child is looked up. Thus, an interlocking stepping of sequence lock checks
1799 * is formed, giving integrity down the path walk.
1801 struct dentry *__d_lookup_rcu(struct dentry *parent, struct qstr *name,
1802 unsigned *seq, struct inode **inode)
1804 unsigned int len = name->len;
1805 unsigned int hash = name->hash;
1806 const unsigned char *str = name->name;
1807 struct hlist_bl_head *b = d_hash(parent, hash);
1808 struct hlist_bl_node *node;
1809 struct dentry *dentry;
1812 * Note: There is significant duplication with __d_lookup_rcu which is
1813 * required to prevent single threaded performance regressions
1814 * especially on architectures where smp_rmb (in seqcounts) are costly.
1815 * Keep the two functions in sync.
1819 * The hash list is protected using RCU.
1821 * Carefully use d_seq when comparing a candidate dentry, to avoid
1822 * races with d_move().
1824 * It is possible that concurrent renames can mess up our list
1825 * walk here and result in missing our dentry, resulting in the
1826 * false-negative result. d_lookup() protects against concurrent
1827 * renames using rename_lock seqlock.
1829 * See Documentation/filesystems/path-lookup.txt for more details.
1831 hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) {
1836 if (dentry->d_name.hash != hash)
1840 *seq = read_seqcount_begin(&dentry->d_seq);
1841 if (dentry->d_parent != parent)
1843 if (d_unhashed(dentry))
1845 tlen = dentry->d_name.len;
1846 tname = dentry->d_name.name;
1847 i = dentry->d_inode;
1852 * This seqcount check is required to ensure name and
1853 * len are loaded atomically, so as not to walk off the
1854 * edge of memory when walking. If we could load this
1855 * atomically some other way, we could drop this check.
1857 if (read_seqcount_retry(&dentry->d_seq, *seq))
1859 if (parent->d_flags & DCACHE_OP_COMPARE) {
1860 if (parent->d_op->d_compare(parent, *inode,
1865 if (dentry_cmp(tname, tlen, str, len))
1869 * No extra seqcount check is required after the name
1870 * compare. The caller must perform a seqcount check in
1871 * order to do anything useful with the returned dentry
1881 * d_lookup - search for a dentry
1882 * @parent: parent dentry
1883 * @name: qstr of name we wish to find
1884 * Returns: dentry, or NULL
1886 * d_lookup searches the children of the parent dentry for the name in
1887 * question. If the dentry is found its reference count is incremented and the
1888 * dentry is returned. The caller must use dput to free the entry when it has
1889 * finished using it. %NULL is returned if the dentry does not exist.
1891 struct dentry *d_lookup(struct dentry *parent, struct qstr *name)
1893 struct dentry *dentry;
1897 seq = read_seqbegin(&rename_lock);
1898 dentry = __d_lookup(parent, name);
1901 } while (read_seqretry(&rename_lock, seq));
1904 EXPORT_SYMBOL(d_lookup);
1907 * __d_lookup - search for a dentry (racy)
1908 * @parent: parent dentry
1909 * @name: qstr of name we wish to find
1910 * Returns: dentry, or NULL
1912 * __d_lookup is like d_lookup, however it may (rarely) return a
1913 * false-negative result due to unrelated rename activity.
1915 * __d_lookup is slightly faster by avoiding rename_lock read seqlock,
1916 * however it must be used carefully, eg. with a following d_lookup in
1917 * the case of failure.
1919 * __d_lookup callers must be commented.
1921 struct dentry *__d_lookup(struct dentry *parent, struct qstr *name)
1923 unsigned int len = name->len;
1924 unsigned int hash = name->hash;
1925 const unsigned char *str = name->name;
1926 struct hlist_bl_head *b = d_hash(parent, hash);
1927 struct hlist_bl_node *node;
1928 struct dentry *found = NULL;
1929 struct dentry *dentry;
1932 * Note: There is significant duplication with __d_lookup_rcu which is
1933 * required to prevent single threaded performance regressions
1934 * especially on architectures where smp_rmb (in seqcounts) are costly.
1935 * Keep the two functions in sync.
1939 * The hash list is protected using RCU.
1941 * Take d_lock when comparing a candidate dentry, to avoid races
1944 * It is possible that concurrent renames can mess up our list
1945 * walk here and result in missing our dentry, resulting in the
1946 * false-negative result. d_lookup() protects against concurrent
1947 * renames using rename_lock seqlock.
1949 * See Documentation/filesystems/path-lookup.txt for more details.
1953 hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) {
1957 if (dentry->d_name.hash != hash)
1960 spin_lock(&dentry->d_lock);
1961 if (dentry->d_parent != parent)
1963 if (d_unhashed(dentry))
1967 * It is safe to compare names since d_move() cannot
1968 * change the qstr (protected by d_lock).
1970 tlen = dentry->d_name.len;
1971 tname = dentry->d_name.name;
1972 if (parent->d_flags & DCACHE_OP_COMPARE) {
1973 if (parent->d_op->d_compare(parent, parent->d_inode,
1974 dentry, dentry->d_inode,
1978 if (dentry_cmp(tname, tlen, str, len))
1984 spin_unlock(&dentry->d_lock);
1987 spin_unlock(&dentry->d_lock);
1995 * d_hash_and_lookup - hash the qstr then search for a dentry
1996 * @dir: Directory to search in
1997 * @name: qstr of name we wish to find
1999 * On hash failure or on lookup failure NULL is returned.
2001 struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name)
2003 struct dentry *dentry = NULL;
2006 * Check for a fs-specific hash function. Note that we must
2007 * calculate the standard hash first, as the d_op->d_hash()
2008 * routine may choose to leave the hash value unchanged.
2010 name->hash = full_name_hash(name->name, name->len);
2011 if (dir->d_flags & DCACHE_OP_HASH) {
2012 if (dir->d_op->d_hash(dir, dir->d_inode, name) < 0)
2015 dentry = d_lookup(dir, name);
2021 * d_validate - verify dentry provided from insecure source (deprecated)
2022 * @dentry: The dentry alleged to be valid child of @dparent
2023 * @dparent: The parent dentry (known to be valid)
2025 * An insecure source has sent us a dentry, here we verify it and dget() it.
2026 * This is used by ncpfs in its readdir implementation.
2027 * Zero is returned in the dentry is invalid.
2029 * This function is slow for big directories, and deprecated, do not use it.
2031 int d_validate(struct dentry *dentry, struct dentry *dparent)
2033 struct dentry *child;
2035 spin_lock(&dparent->d_lock);
2036 list_for_each_entry(child, &dparent->d_subdirs, d_u.d_child) {
2037 if (dentry == child) {
2038 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
2039 __dget_dlock(dentry);
2040 spin_unlock(&dentry->d_lock);
2041 spin_unlock(&dparent->d_lock);
2045 spin_unlock(&dparent->d_lock);
2049 EXPORT_SYMBOL(d_validate);
2052 * When a file is deleted, we have two options:
2053 * - turn this dentry into a negative dentry
2054 * - unhash this dentry and free it.
2056 * Usually, we want to just turn this into
2057 * a negative dentry, but if anybody else is
2058 * currently using the dentry or the inode
2059 * we can't do that and we fall back on removing
2060 * it from the hash queues and waiting for
2061 * it to be deleted later when it has no users
2065 * d_delete - delete a dentry
2066 * @dentry: The dentry to delete
2068 * Turn the dentry into a negative dentry if possible, otherwise
2069 * remove it from the hash queues so it can be deleted later
2072 void d_delete(struct dentry * dentry)
2074 struct inode *inode;
2077 * Are we the only user?
2080 spin_lock(&dentry->d_lock);
2081 inode = dentry->d_inode;
2082 isdir = S_ISDIR(inode->i_mode);
2083 if (dentry->d_count == 1) {
2084 if (inode && !spin_trylock(&inode->i_lock)) {
2085 spin_unlock(&dentry->d_lock);
2089 dentry->d_flags &= ~DCACHE_CANT_MOUNT;
2090 dentry_unlink_inode(dentry);
2091 fsnotify_nameremove(dentry, isdir);
2095 if (!d_unhashed(dentry))
2098 spin_unlock(&dentry->d_lock);
2100 fsnotify_nameremove(dentry, isdir);
2102 EXPORT_SYMBOL(d_delete);
2104 static void __d_rehash(struct dentry * entry, struct hlist_bl_head *b)
2106 BUG_ON(!d_unhashed(entry));
2108 entry->d_flags |= DCACHE_RCUACCESS;
2109 hlist_bl_add_head_rcu(&entry->d_hash, b);
2113 static void _d_rehash(struct dentry * entry)
2115 __d_rehash(entry, d_hash(entry->d_parent, entry->d_name.hash));
2119 * d_rehash - add an entry back to the hash
2120 * @entry: dentry to add to the hash
2122 * Adds a dentry to the hash according to its name.
2125 void d_rehash(struct dentry * entry)
2127 spin_lock(&entry->d_lock);
2129 spin_unlock(&entry->d_lock);
2131 EXPORT_SYMBOL(d_rehash);
2134 * dentry_update_name_case - update case insensitive dentry with a new name
2135 * @dentry: dentry to be updated
2138 * Update a case insensitive dentry with new case of name.
2140 * dentry must have been returned by d_lookup with name @name. Old and new
2141 * name lengths must match (ie. no d_compare which allows mismatched name
2144 * Parent inode i_mutex must be held over d_lookup and into this call (to
2145 * keep renames and concurrent inserts, and readdir(2) away).
2147 void dentry_update_name_case(struct dentry *dentry, struct qstr *name)
2149 BUG_ON(!mutex_is_locked(&dentry->d_parent->d_inode->i_mutex));
2150 BUG_ON(dentry->d_name.len != name->len); /* d_lookup gives this */
2152 spin_lock(&dentry->d_lock);
2153 write_seqcount_begin(&dentry->d_seq);
2154 memcpy((unsigned char *)dentry->d_name.name, name->name, name->len);
2155 write_seqcount_end(&dentry->d_seq);
2156 spin_unlock(&dentry->d_lock);
2158 EXPORT_SYMBOL(dentry_update_name_case);
2160 static void switch_names(struct dentry *dentry, struct dentry *target)
2162 if (dname_external(target)) {
2163 if (dname_external(dentry)) {
2165 * Both external: swap the pointers
2167 swap(target->d_name.name, dentry->d_name.name);
2170 * dentry:internal, target:external. Steal target's
2171 * storage and make target internal.
2173 memcpy(target->d_iname, dentry->d_name.name,
2174 dentry->d_name.len + 1);
2175 dentry->d_name.name = target->d_name.name;
2176 target->d_name.name = target->d_iname;
2179 if (dname_external(dentry)) {
2181 * dentry:external, target:internal. Give dentry's
2182 * storage to target and make dentry internal
2184 memcpy(dentry->d_iname, target->d_name.name,
2185 target->d_name.len + 1);
2186 target->d_name.name = dentry->d_name.name;
2187 dentry->d_name.name = dentry->d_iname;
2190 * Both are internal. Just copy target to dentry
2192 memcpy(dentry->d_iname, target->d_name.name,
2193 target->d_name.len + 1);
2194 dentry->d_name.len = target->d_name.len;
2198 swap(dentry->d_name.len, target->d_name.len);
2201 static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
2204 * XXXX: do we really need to take target->d_lock?
2206 if (IS_ROOT(dentry) || dentry->d_parent == target->d_parent)
2207 spin_lock(&target->d_parent->d_lock);
2209 if (d_ancestor(dentry->d_parent, target->d_parent)) {
2210 spin_lock(&dentry->d_parent->d_lock);
2211 spin_lock_nested(&target->d_parent->d_lock,
2212 DENTRY_D_LOCK_NESTED);
2214 spin_lock(&target->d_parent->d_lock);
2215 spin_lock_nested(&dentry->d_parent->d_lock,
2216 DENTRY_D_LOCK_NESTED);
2219 if (target < dentry) {
2220 spin_lock_nested(&target->d_lock, 2);
2221 spin_lock_nested(&dentry->d_lock, 3);
2223 spin_lock_nested(&dentry->d_lock, 2);
2224 spin_lock_nested(&target->d_lock, 3);
2228 static void dentry_unlock_parents_for_move(struct dentry *dentry,
2229 struct dentry *target)
2231 if (target->d_parent != dentry->d_parent)
2232 spin_unlock(&dentry->d_parent->d_lock);
2233 if (target->d_parent != target)
2234 spin_unlock(&target->d_parent->d_lock);
2238 * When switching names, the actual string doesn't strictly have to
2239 * be preserved in the target - because we're dropping the target
2240 * anyway. As such, we can just do a simple memcpy() to copy over
2241 * the new name before we switch.
2243 * Note that we have to be a lot more careful about getting the hash
2244 * switched - we have to switch the hash value properly even if it
2245 * then no longer matches the actual (corrupted) string of the target.
2246 * The hash value has to match the hash queue that the dentry is on..
2249 * __d_move - move a dentry
2250 * @dentry: entry to move
2251 * @target: new dentry
2253 * Update the dcache to reflect the move of a file name. Negative
2254 * dcache entries should not be moved in this way. Caller hold
2257 static void __d_move(struct dentry * dentry, struct dentry * target)
2259 if (!dentry->d_inode)
2260 printk(KERN_WARNING "VFS: moving negative dcache entry\n");
2262 BUG_ON(d_ancestor(dentry, target));
2263 BUG_ON(d_ancestor(target, dentry));
2265 dentry_lock_for_move(dentry, target);
2267 write_seqcount_begin(&dentry->d_seq);
2268 write_seqcount_begin(&target->d_seq);
2270 /* __d_drop does write_seqcount_barrier, but they're OK to nest. */
2273 * Move the dentry to the target hash queue. Don't bother checking
2274 * for the same hash queue because of how unlikely it is.
2277 __d_rehash(dentry, d_hash(target->d_parent, target->d_name.hash));
2279 /* Unhash the target: dput() will then get rid of it */
2282 list_del(&dentry->d_u.d_child);
2283 list_del(&target->d_u.d_child);
2285 /* Switch the names.. */
2286 switch_names(dentry, target);
2287 swap(dentry->d_name.hash, target->d_name.hash);
2289 /* ... and switch the parents */
2290 if (IS_ROOT(dentry)) {
2291 dentry->d_parent = target->d_parent;
2292 target->d_parent = target;
2293 INIT_LIST_HEAD(&target->d_u.d_child);
2295 swap(dentry->d_parent, target->d_parent);
2297 /* And add them back to the (new) parent lists */
2298 list_add(&target->d_u.d_child, &target->d_parent->d_subdirs);
2301 list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
2303 write_seqcount_end(&target->d_seq);
2304 write_seqcount_end(&dentry->d_seq);
2306 dentry_unlock_parents_for_move(dentry, target);
2307 spin_unlock(&target->d_lock);
2308 fsnotify_d_move(dentry);
2309 spin_unlock(&dentry->d_lock);
2313 * d_move - move a dentry
2314 * @dentry: entry to move
2315 * @target: new dentry
2317 * Update the dcache to reflect the move of a file name. Negative
2318 * dcache entries should not be moved in this way.
2320 void d_move(struct dentry *dentry, struct dentry *target)
2322 write_seqlock(&rename_lock);
2323 __d_move(dentry, target);
2324 write_sequnlock(&rename_lock);
2326 EXPORT_SYMBOL(d_move);
2329 * d_ancestor - search for an ancestor
2330 * @p1: ancestor dentry
2333 * Returns the ancestor dentry of p2 which is a child of p1, if p1 is
2334 * an ancestor of p2, else NULL.
2336 struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2)
2340 for (p = p2; !IS_ROOT(p); p = p->d_parent) {
2341 if (p->d_parent == p1)
2348 * This helper attempts to cope with remotely renamed directories
2350 * It assumes that the caller is already holding
2351 * dentry->d_parent->d_inode->i_mutex, inode->i_lock and rename_lock
2353 * Note: If ever the locking in lock_rename() changes, then please
2354 * remember to update this too...
2356 static struct dentry *__d_unalias(struct inode *inode,
2357 struct dentry *dentry, struct dentry *alias)
2359 struct mutex *m1 = NULL, *m2 = NULL;
2362 /* If alias and dentry share a parent, then no extra locks required */
2363 if (alias->d_parent == dentry->d_parent)
2366 /* See lock_rename() */
2367 ret = ERR_PTR(-EBUSY);
2368 if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex))
2370 m1 = &dentry->d_sb->s_vfs_rename_mutex;
2371 if (!mutex_trylock(&alias->d_parent->d_inode->i_mutex))
2373 m2 = &alias->d_parent->d_inode->i_mutex;
2375 __d_move(alias, dentry);
2378 spin_unlock(&inode->i_lock);
2387 * Prepare an anonymous dentry for life in the superblock's dentry tree as a
2388 * named dentry in place of the dentry to be replaced.
2389 * returns with anon->d_lock held!
2391 static void __d_materialise_dentry(struct dentry *dentry, struct dentry *anon)
2393 struct dentry *dparent, *aparent;
2395 dentry_lock_for_move(anon, dentry);
2397 write_seqcount_begin(&dentry->d_seq);
2398 write_seqcount_begin(&anon->d_seq);
2400 dparent = dentry->d_parent;
2401 aparent = anon->d_parent;
2403 switch_names(dentry, anon);
2404 swap(dentry->d_name.hash, anon->d_name.hash);
2406 dentry->d_parent = (aparent == anon) ? dentry : aparent;
2407 list_del(&dentry->d_u.d_child);
2408 if (!IS_ROOT(dentry))
2409 list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
2411 INIT_LIST_HEAD(&dentry->d_u.d_child);
2413 anon->d_parent = (dparent == dentry) ? anon : dparent;
2414 list_del(&anon->d_u.d_child);
2416 list_add(&anon->d_u.d_child, &anon->d_parent->d_subdirs);
2418 INIT_LIST_HEAD(&anon->d_u.d_child);
2420 write_seqcount_end(&dentry->d_seq);
2421 write_seqcount_end(&anon->d_seq);
2423 dentry_unlock_parents_for_move(anon, dentry);
2424 spin_unlock(&dentry->d_lock);
2426 /* anon->d_lock still locked, returns locked */
2427 anon->d_flags &= ~DCACHE_DISCONNECTED;
2431 * d_materialise_unique - introduce an inode into the tree
2432 * @dentry: candidate dentry
2433 * @inode: inode to bind to the dentry, to which aliases may be attached
2435 * Introduces an dentry into the tree, substituting an extant disconnected
2436 * root directory alias in its place if there is one
2438 struct dentry *d_materialise_unique(struct dentry *dentry, struct inode *inode)
2440 struct dentry *actual;
2442 BUG_ON(!d_unhashed(dentry));
2446 __d_instantiate(dentry, NULL);
2451 spin_lock(&inode->i_lock);
2453 if (S_ISDIR(inode->i_mode)) {
2454 struct dentry *alias;
2456 /* Does an aliased dentry already exist? */
2457 alias = __d_find_alias(inode, 0);
2460 write_seqlock(&rename_lock);
2462 if (d_ancestor(alias, dentry)) {
2463 /* Check for loops */
2464 actual = ERR_PTR(-ELOOP);
2465 } else if (IS_ROOT(alias)) {
2466 /* Is this an anonymous mountpoint that we
2467 * could splice into our tree? */
2468 __d_materialise_dentry(dentry, alias);
2469 write_sequnlock(&rename_lock);
2473 /* Nope, but we must(!) avoid directory
2475 actual = __d_unalias(inode, dentry, alias);
2477 write_sequnlock(&rename_lock);
2484 /* Add a unique reference */
2485 actual = __d_instantiate_unique(dentry, inode);
2489 BUG_ON(!d_unhashed(actual));
2491 spin_lock(&actual->d_lock);
2494 spin_unlock(&actual->d_lock);
2495 spin_unlock(&inode->i_lock);
2497 if (actual == dentry) {
2498 security_d_instantiate(dentry, inode);
2505 EXPORT_SYMBOL_GPL(d_materialise_unique);
2507 static int prepend(char **buffer, int *buflen, const char *str, int namelen)
2511 return -ENAMETOOLONG;
2513 memcpy(*buffer, str, namelen);
2517 static int prepend_name(char **buffer, int *buflen, struct qstr *name)
2519 return prepend(buffer, buflen, name->name, name->len);
2523 * prepend_path - Prepend path string to a buffer
2524 * @path: the dentry/vfsmount to report
2525 * @root: root vfsmnt/dentry (may be modified by this function)
2526 * @buffer: pointer to the end of the buffer
2527 * @buflen: pointer to buffer length
2529 * Caller holds the rename_lock.
2531 * If path is not reachable from the supplied root, then the value of
2532 * root is changed (without modifying refcounts).
2534 static int prepend_path(const struct path *path, struct path *root,
2535 char **buffer, int *buflen)
2537 struct dentry *dentry = path->dentry;
2538 struct vfsmount *vfsmnt = path->mnt;
2542 br_read_lock(vfsmount_lock);
2543 while (dentry != root->dentry || vfsmnt != root->mnt) {
2544 struct dentry * parent;
2546 if (dentry == vfsmnt->mnt_root || IS_ROOT(dentry)) {
2548 if (vfsmnt->mnt_parent == vfsmnt) {
2551 dentry = vfsmnt->mnt_mountpoint;
2552 vfsmnt = vfsmnt->mnt_parent;
2555 parent = dentry->d_parent;
2557 spin_lock(&dentry->d_lock);
2558 error = prepend_name(buffer, buflen, &dentry->d_name);
2559 spin_unlock(&dentry->d_lock);
2561 error = prepend(buffer, buflen, "/", 1);
2570 if (!error && !slash)
2571 error = prepend(buffer, buflen, "/", 1);
2573 br_read_unlock(vfsmount_lock);
2578 * Filesystems needing to implement special "root names"
2579 * should do so with ->d_dname()
2581 if (IS_ROOT(dentry) &&
2582 (dentry->d_name.len != 1 || dentry->d_name.name[0] != '/')) {
2583 WARN(1, "Root dentry has weird name <%.*s>\n",
2584 (int) dentry->d_name.len, dentry->d_name.name);
2587 root->dentry = dentry;
2592 * __d_path - return the path of a dentry
2593 * @path: the dentry/vfsmount to report
2594 * @root: root vfsmnt/dentry (may be modified by this function)
2595 * @buf: buffer to return value in
2596 * @buflen: buffer length
2598 * Convert a dentry into an ASCII path name.
2600 * Returns a pointer into the buffer or an error code if the
2601 * path was too long.
2603 * "buflen" should be positive.
2605 * If path is not reachable from the supplied root, then the value of
2606 * root is changed (without modifying refcounts).
2608 char *__d_path(const struct path *path, struct path *root,
2609 char *buf, int buflen)
2611 char *res = buf + buflen;
2614 prepend(&res, &buflen, "\0", 1);
2615 write_seqlock(&rename_lock);
2616 error = prepend_path(path, root, &res, &buflen);
2617 write_sequnlock(&rename_lock);
2620 return ERR_PTR(error);
2625 * same as __d_path but appends "(deleted)" for unlinked files.
2627 static int path_with_deleted(const struct path *path, struct path *root,
2628 char **buf, int *buflen)
2630 prepend(buf, buflen, "\0", 1);
2631 if (d_unlinked(path->dentry)) {
2632 int error = prepend(buf, buflen, " (deleted)", 10);
2637 return prepend_path(path, root, buf, buflen);
2640 static int prepend_unreachable(char **buffer, int *buflen)
2642 return prepend(buffer, buflen, "(unreachable)", 13);
2646 * d_path - return the path of a dentry
2647 * @path: path to report
2648 * @buf: buffer to return value in
2649 * @buflen: buffer length
2651 * Convert a dentry into an ASCII path name. If the entry has been deleted
2652 * the string " (deleted)" is appended. Note that this is ambiguous.
2654 * Returns a pointer into the buffer or an error code if the path was
2655 * too long. Note: Callers should use the returned pointer, not the passed
2656 * in buffer, to use the name! The implementation often starts at an offset
2657 * into the buffer, and may leave 0 bytes at the start.
2659 * "buflen" should be positive.
2661 char *d_path(const struct path *path, char *buf, int buflen)
2663 char *res = buf + buflen;
2669 * We have various synthetic filesystems that never get mounted. On
2670 * these filesystems dentries are never used for lookup purposes, and
2671 * thus don't need to be hashed. They also don't need a name until a
2672 * user wants to identify the object in /proc/pid/fd/. The little hack
2673 * below allows us to generate a name for these objects on demand:
2675 if (path->dentry->d_op && path->dentry->d_op->d_dname)
2676 return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
2678 get_fs_root(current->fs, &root);
2679 write_seqlock(&rename_lock);
2681 error = path_with_deleted(path, &tmp, &res, &buflen);
2683 res = ERR_PTR(error);
2684 write_sequnlock(&rename_lock);
2688 EXPORT_SYMBOL(d_path);
2691 * d_path_with_unreachable - return the path of a dentry
2692 * @path: path to report
2693 * @buf: buffer to return value in
2694 * @buflen: buffer length
2696 * The difference from d_path() is that this prepends "(unreachable)"
2697 * to paths which are unreachable from the current process' root.
2699 char *d_path_with_unreachable(const struct path *path, char *buf, int buflen)
2701 char *res = buf + buflen;
2706 if (path->dentry->d_op && path->dentry->d_op->d_dname)
2707 return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
2709 get_fs_root(current->fs, &root);
2710 write_seqlock(&rename_lock);
2712 error = path_with_deleted(path, &tmp, &res, &buflen);
2713 if (!error && !path_equal(&tmp, &root))
2714 error = prepend_unreachable(&res, &buflen);
2715 write_sequnlock(&rename_lock);
2718 res = ERR_PTR(error);
2724 * Helper function for dentry_operations.d_dname() members
2726 char *dynamic_dname(struct dentry *dentry, char *buffer, int buflen,
2727 const char *fmt, ...)
2733 va_start(args, fmt);
2734 sz = vsnprintf(temp, sizeof(temp), fmt, args) + 1;
2737 if (sz > sizeof(temp) || sz > buflen)
2738 return ERR_PTR(-ENAMETOOLONG);
2740 buffer += buflen - sz;
2741 return memcpy(buffer, temp, sz);
2745 * Write full pathname from the root of the filesystem into the buffer.
2747 static char *__dentry_path(struct dentry *dentry, char *buf, int buflen)
2749 char *end = buf + buflen;
2752 prepend(&end, &buflen, "\0", 1);
2759 while (!IS_ROOT(dentry)) {
2760 struct dentry *parent = dentry->d_parent;
2764 spin_lock(&dentry->d_lock);
2765 error = prepend_name(&end, &buflen, &dentry->d_name);
2766 spin_unlock(&dentry->d_lock);
2767 if (error != 0 || prepend(&end, &buflen, "/", 1) != 0)
2775 return ERR_PTR(-ENAMETOOLONG);
2778 char *dentry_path_raw(struct dentry *dentry, char *buf, int buflen)
2782 write_seqlock(&rename_lock);
2783 retval = __dentry_path(dentry, buf, buflen);
2784 write_sequnlock(&rename_lock);
2788 EXPORT_SYMBOL(dentry_path_raw);
2790 char *dentry_path(struct dentry *dentry, char *buf, int buflen)
2795 write_seqlock(&rename_lock);
2796 if (d_unlinked(dentry)) {
2798 if (prepend(&p, &buflen, "//deleted", 10) != 0)
2802 retval = __dentry_path(dentry, buf, buflen);
2803 write_sequnlock(&rename_lock);
2804 if (!IS_ERR(retval) && p)
2805 *p = '/'; /* restore '/' overriden with '\0' */
2808 return ERR_PTR(-ENAMETOOLONG);
2812 * NOTE! The user-level library version returns a
2813 * character pointer. The kernel system call just
2814 * returns the length of the buffer filled (which
2815 * includes the ending '\0' character), or a negative
2816 * error value. So libc would do something like
2818 * char *getcwd(char * buf, size_t size)
2822 * retval = sys_getcwd(buf, size);
2829 SYSCALL_DEFINE2(getcwd, char __user *, buf, unsigned long, size)
2832 struct path pwd, root;
2833 char *page = (char *) __get_free_page(GFP_USER);
2838 get_fs_root_and_pwd(current->fs, &root, &pwd);
2841 write_seqlock(&rename_lock);
2842 if (!d_unlinked(pwd.dentry)) {
2844 struct path tmp = root;
2845 char *cwd = page + PAGE_SIZE;
2846 int buflen = PAGE_SIZE;
2848 prepend(&cwd, &buflen, "\0", 1);
2849 error = prepend_path(&pwd, &tmp, &cwd, &buflen);
2850 write_sequnlock(&rename_lock);
2855 /* Unreachable from current root */
2856 if (!path_equal(&tmp, &root)) {
2857 error = prepend_unreachable(&cwd, &buflen);
2863 len = PAGE_SIZE + page - cwd;
2866 if (copy_to_user(buf, cwd, len))
2870 write_sequnlock(&rename_lock);
2876 free_page((unsigned long) page);
2881 * Test whether new_dentry is a subdirectory of old_dentry.
2883 * Trivially implemented using the dcache structure
2887 * is_subdir - is new dentry a subdirectory of old_dentry
2888 * @new_dentry: new dentry
2889 * @old_dentry: old dentry
2891 * Returns 1 if new_dentry is a subdirectory of the parent (at any depth).
2892 * Returns 0 otherwise.
2893 * Caller must ensure that "new_dentry" is pinned before calling is_subdir()
2896 int is_subdir(struct dentry *new_dentry, struct dentry *old_dentry)
2901 if (new_dentry == old_dentry)
2905 /* for restarting inner loop in case of seq retry */
2906 seq = read_seqbegin(&rename_lock);
2908 * Need rcu_readlock to protect against the d_parent trashing
2912 if (d_ancestor(old_dentry, new_dentry))
2917 } while (read_seqretry(&rename_lock, seq));
2922 int path_is_under(struct path *path1, struct path *path2)
2924 struct vfsmount *mnt = path1->mnt;
2925 struct dentry *dentry = path1->dentry;
2928 br_read_lock(vfsmount_lock);
2929 if (mnt != path2->mnt) {
2931 if (mnt->mnt_parent == mnt) {
2932 br_read_unlock(vfsmount_lock);
2935 if (mnt->mnt_parent == path2->mnt)
2937 mnt = mnt->mnt_parent;
2939 dentry = mnt->mnt_mountpoint;
2941 res = is_subdir(dentry, path2->dentry);
2942 br_read_unlock(vfsmount_lock);
2945 EXPORT_SYMBOL(path_is_under);
2947 void d_genocide(struct dentry *root)
2949 struct dentry *this_parent;
2950 struct list_head *next;
2954 seq = read_seqbegin(&rename_lock);
2957 spin_lock(&this_parent->d_lock);
2959 next = this_parent->d_subdirs.next;
2961 while (next != &this_parent->d_subdirs) {
2962 struct list_head *tmp = next;
2963 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
2966 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
2967 if (d_unhashed(dentry) || !dentry->d_inode) {
2968 spin_unlock(&dentry->d_lock);
2971 if (!list_empty(&dentry->d_subdirs)) {
2972 spin_unlock(&this_parent->d_lock);
2973 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
2974 this_parent = dentry;
2975 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
2978 if (!(dentry->d_flags & DCACHE_GENOCIDE)) {
2979 dentry->d_flags |= DCACHE_GENOCIDE;
2982 spin_unlock(&dentry->d_lock);
2984 if (this_parent != root) {
2985 struct dentry *child = this_parent;
2986 if (!(this_parent->d_flags & DCACHE_GENOCIDE)) {
2987 this_parent->d_flags |= DCACHE_GENOCIDE;
2988 this_parent->d_count--;
2990 this_parent = try_to_ascend(this_parent, locked, seq);
2993 next = child->d_u.d_child.next;
2996 spin_unlock(&this_parent->d_lock);
2997 if (!locked && read_seqretry(&rename_lock, seq))
3000 write_sequnlock(&rename_lock);
3005 write_seqlock(&rename_lock);
3010 * find_inode_number - check for dentry with name
3011 * @dir: directory to check
3012 * @name: Name to find.
3014 * Check whether a dentry already exists for the given name,
3015 * and return the inode number if it has an inode. Otherwise
3018 * This routine is used to post-process directory listings for
3019 * filesystems using synthetic inode numbers, and is necessary
3020 * to keep getcwd() working.
3023 ino_t find_inode_number(struct dentry *dir, struct qstr *name)
3025 struct dentry * dentry;
3028 dentry = d_hash_and_lookup(dir, name);
3030 if (dentry->d_inode)
3031 ino = dentry->d_inode->i_ino;
3036 EXPORT_SYMBOL(find_inode_number);
3038 static __initdata unsigned long dhash_entries;
3039 static int __init set_dhash_entries(char *str)
3043 dhash_entries = simple_strtoul(str, &str, 0);
3046 __setup("dhash_entries=", set_dhash_entries);
3048 static void __init dcache_init_early(void)
3052 /* If hashes are distributed across NUMA nodes, defer
3053 * hash allocation until vmalloc space is available.
3059 alloc_large_system_hash("Dentry cache",
3060 sizeof(struct hlist_bl_head),
3068 for (loop = 0; loop < (1 << d_hash_shift); loop++)
3069 INIT_HLIST_BL_HEAD(dentry_hashtable + loop);
3072 static void __init dcache_init(void)
3077 * A constructor could be added for stable state like the lists,
3078 * but it is probably not worth it because of the cache nature
3081 dentry_cache = KMEM_CACHE(dentry,
3082 SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD);
3084 register_shrinker(&dcache_shrinker);
3086 /* Hash may have been set up in dcache_init_early */
3091 alloc_large_system_hash("Dentry cache",
3092 sizeof(struct hlist_bl_head),
3100 for (loop = 0; loop < (1 << d_hash_shift); loop++)
3101 INIT_HLIST_BL_HEAD(dentry_hashtable + loop);
3104 /* SLAB cache for __getname() consumers */
3105 struct kmem_cache *names_cachep __read_mostly;
3106 EXPORT_SYMBOL(names_cachep);
3108 EXPORT_SYMBOL(d_genocide);
3110 void __init vfs_caches_init_early(void)
3112 dcache_init_early();
3116 void __init vfs_caches_init(unsigned long mempages)
3118 unsigned long reserve;
3120 /* Base hash sizes on available memory, with a reserve equal to
3121 150% of current kernel size */
3123 reserve = min((mempages - nr_free_pages()) * 3/2, mempages - 1);
3124 mempages -= reserve;
3126 names_cachep = kmem_cache_create("names_cache", PATH_MAX, 0,
3127 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
3131 files_init(mempages);