blob: f09b9085f7d849e235a2b8d77c079de71c96f5d2 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * fs/dcache.c
3 *
4 * Complete reimplementation
5 * (C) 1997 Thomas Schoebel-Theuer,
6 * with heavy changes by Linus Torvalds
7 */
8
9/*
10 * Notes on the allocation strategy:
11 *
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.
15 */
16
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <linux/syscalls.h>
18#include <linux/string.h>
19#include <linux/mm.h>
20#include <linux/fs.h>
John McCutchan7a91bf72005-08-08 13:52:16 -040021#include <linux/fsnotify.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <linux/slab.h>
23#include <linux/init.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/hash.h>
25#include <linux/cache.h>
Paul Gortmaker630d9c42011-11-16 23:57:37 -050026#include <linux/export.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#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>
Al Viro5ad4e532009-03-29 19:50:06 -040034#include <linux/fs_struct.h>
Frederic Weisbecker613afbf2009-07-16 15:44:29 +020035#include <linux/hardirq.h>
Nick Pigginceb5bdc2011-01-07 17:50:05 +110036#include <linux/bit_spinlock.h>
37#include <linux/rculist_bl.h>
Linus Torvalds268bb0c2011-05-20 12:50:29 -070038#include <linux/prefetch.h>
David Howellsdd179942011-08-16 15:31:30 +010039#include <linux/ratelimit.h>
David Howells07f3f052006-09-30 20:52:18 +020040#include "internal.h"
Al Virob2dba1a2011-11-23 19:26:23 -050041#include "mount.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070042
Nick Piggin789680d2011-01-07 17:49:30 +110043/*
44 * Usage:
Nick Piggin873feea2011-01-07 17:50:06 +110045 * dcache->d_inode->i_lock protects:
46 * - i_dentry, d_alias, d_inode of aliases
Nick Pigginceb5bdc2011-01-07 17:50:05 +110047 * dcache_hash_bucket lock protects:
48 * - the dcache hash table
49 * s_anon bl list spinlock protects:
50 * - the s_anon list (see __d_drop)
Nick Piggin23044502011-01-07 17:49:31 +110051 * dcache_lru_lock protects:
52 * - the dcache lru lists and counters
53 * d_lock protects:
54 * - d_flags
55 * - d_name
56 * - d_lru
Nick Pigginb7ab39f2011-01-07 17:49:32 +110057 * - d_count
Nick Pigginda502952011-01-07 17:49:33 +110058 * - d_unhashed()
Nick Piggin2fd6b7f2011-01-07 17:49:34 +110059 * - d_parent and d_subdirs
60 * - childrens' d_child and d_parent
Nick Pigginb23fb0a2011-01-07 17:49:35 +110061 * - d_alias, d_inode
Nick Piggin789680d2011-01-07 17:49:30 +110062 *
63 * Ordering:
Nick Piggin873feea2011-01-07 17:50:06 +110064 * dentry->d_inode->i_lock
Nick Pigginb5c84bf2011-01-07 17:49:38 +110065 * dentry->d_lock
66 * dcache_lru_lock
Nick Pigginceb5bdc2011-01-07 17:50:05 +110067 * dcache_hash_bucket lock
68 * s_anon lock
Nick Piggin789680d2011-01-07 17:49:30 +110069 *
Nick Pigginda502952011-01-07 17:49:33 +110070 * If there is an ancestor relationship:
71 * dentry->d_parent->...->d_parent->d_lock
72 * ...
73 * dentry->d_parent->d_lock
74 * dentry->d_lock
75 *
76 * If no ancestor relationship:
Nick Piggin789680d2011-01-07 17:49:30 +110077 * if (dentry1 < dentry2)
78 * dentry1->d_lock
79 * dentry2->d_lock
80 */
Eric Dumazetfa3536c2006-03-26 01:37:24 -080081int sysctl_vfs_cache_pressure __read_mostly = 100;
Linus Torvalds1da177e2005-04-16 15:20:36 -070082EXPORT_SYMBOL_GPL(sysctl_vfs_cache_pressure);
83
Nick Piggin23044502011-01-07 17:49:31 +110084static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_lru_lock);
Al Viro74c3cbe2007-07-22 08:04:18 -040085__cacheline_aligned_in_smp DEFINE_SEQLOCK(rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
Nick Piggin949854d2011-01-07 17:49:37 +110087EXPORT_SYMBOL(rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
Christoph Lametere18b8902006-12-06 20:33:20 -080089static struct kmem_cache *dentry_cache __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070090
Linus Torvalds1da177e2005-04-16 15:20:36 -070091/*
92 * This is the single most critical data structure when it comes
93 * to the dcache: the hashtable for lookups. Somebody should try
94 * to make this good - I've just made it work.
95 *
96 * This hash-function tries to avoid losing too many bits of hash
97 * information, yet avoid using a prime hash-size or similar.
98 */
99#define D_HASHBITS d_hash_shift
100#define D_HASHMASK d_hash_mask
101
Eric Dumazetfa3536c2006-03-26 01:37:24 -0800102static unsigned int d_hash_mask __read_mostly;
103static unsigned int d_hash_shift __read_mostly;
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100104
Linus Torvaldsb07ad992011-04-23 22:32:03 -0700105static struct hlist_bl_head *dentry_hashtable __read_mostly;
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100106
Linus Torvalds8966be92012-03-02 14:23:30 -0800107static inline struct hlist_bl_head *d_hash(const struct dentry *parent,
Linus Torvalds6d7d1a02012-03-19 16:19:53 -0700108 unsigned int hash)
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100109{
Linus Torvalds6d7d1a02012-03-19 16:19:53 -0700110 hash += (unsigned long) parent / L1_CACHE_BYTES;
111 hash = hash + (hash >> D_HASHBITS);
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100112 return dentry_hashtable + (hash & D_HASHMASK);
113}
114
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115/* Statistics gathering. */
116struct dentry_stat_t dentry_stat = {
117 .age_limit = 45,
118};
119
Nick Piggin3e880fb2011-01-07 17:49:19 +1100120static DEFINE_PER_CPU(unsigned int, nr_dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400121
122#if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
Nick Piggin3e880fb2011-01-07 17:49:19 +1100123static int get_nr_dentry(void)
124{
125 int i;
126 int sum = 0;
127 for_each_possible_cpu(i)
128 sum += per_cpu(nr_dentry, i);
129 return sum < 0 ? 0 : sum;
130}
131
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400132int proc_nr_dentry(ctl_table *table, int write, void __user *buffer,
133 size_t *lenp, loff_t *ppos)
134{
Nick Piggin3e880fb2011-01-07 17:49:19 +1100135 dentry_stat.nr_dentry = get_nr_dentry();
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400136 return proc_dointvec(table, write, buffer, lenp, ppos);
137}
138#endif
139
Linus Torvalds5483f182012-03-04 15:51:42 -0800140/*
141 * Compare 2 name strings, return 0 if they match, otherwise non-zero.
142 * The strings are both count bytes long, and count is non-zero.
143 */
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700144#ifdef CONFIG_DCACHE_WORD_ACCESS
145
146#include <asm/word-at-a-time.h>
147/*
148 * NOTE! 'cs' and 'scount' come from a dentry, so it has a
149 * aligned allocation for this particular component. We don't
150 * strictly need the load_unaligned_zeropad() safety, but it
151 * doesn't hurt either.
152 *
153 * In contrast, 'ct' and 'tcount' can be from a pathname, and do
154 * need the careful unaligned handling.
155 */
Linus Torvalds94753db52012-05-10 12:19:19 -0700156static inline int dentry_string_cmp(const unsigned char *cs, const unsigned char *ct, unsigned tcount)
Linus Torvalds5483f182012-03-04 15:51:42 -0800157{
Linus Torvaldsbfcfaa72012-03-06 11:16:17 -0800158 unsigned long a,b,mask;
Linus Torvaldsbfcfaa72012-03-06 11:16:17 -0800159
160 for (;;) {
Linus Torvalds12f8ad42012-05-04 14:59:14 -0700161 a = *(unsigned long *)cs;
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700162 b = load_unaligned_zeropad(ct);
Linus Torvaldsbfcfaa72012-03-06 11:16:17 -0800163 if (tcount < sizeof(unsigned long))
164 break;
165 if (unlikely(a != b))
166 return 1;
167 cs += sizeof(unsigned long);
168 ct += sizeof(unsigned long);
169 tcount -= sizeof(unsigned long);
170 if (!tcount)
171 return 0;
172 }
173 mask = ~(~0ul << tcount*8);
174 return unlikely(!!((a ^ b) & mask));
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700175}
176
Linus Torvaldsbfcfaa72012-03-06 11:16:17 -0800177#else
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700178
Linus Torvalds94753db52012-05-10 12:19:19 -0700179static inline int dentry_string_cmp(const unsigned char *cs, const unsigned char *ct, unsigned tcount)
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700180{
Linus Torvalds5483f182012-03-04 15:51:42 -0800181 do {
182 if (*cs != *ct)
183 return 1;
184 cs++;
185 ct++;
186 tcount--;
187 } while (tcount);
188 return 0;
189}
190
Linus Torvaldse419b4c2012-05-03 10:16:43 -0700191#endif
192
Linus Torvalds94753db52012-05-10 12:19:19 -0700193static inline int dentry_cmp(const struct dentry *dentry, const unsigned char *ct, unsigned tcount)
194{
Linus Torvalds6326c712012-05-21 16:14:04 -0700195 const unsigned char *cs;
Linus Torvalds94753db52012-05-10 12:19:19 -0700196 /*
197 * Be careful about RCU walk racing with rename:
198 * use ACCESS_ONCE to fetch the name pointer.
199 *
200 * NOTE! Even if a rename will mean that the length
201 * was not loaded atomically, we don't care. The
202 * RCU walk will check the sequence count eventually,
203 * and catch it. And we won't overrun the buffer,
204 * because we're reading the name pointer atomically,
205 * and a dentry name is guaranteed to be properly
206 * terminated with a NUL byte.
207 *
208 * End result: even if 'len' is wrong, we'll exit
209 * early because the data cannot match (there can
210 * be no NUL in the ct/tcount data)
211 */
Linus Torvalds6326c712012-05-21 16:14:04 -0700212 cs = ACCESS_ONCE(dentry->d_name.name);
213 smp_read_barrier_depends();
214 return dentry_string_cmp(cs, ct, tcount);
Linus Torvalds94753db52012-05-10 12:19:19 -0700215}
216
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400217static void __d_free(struct rcu_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218{
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400219 struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu);
220
Al Virob3d9b7a2012-06-09 13:51:19 -0400221 WARN_ON(!hlist_unhashed(&dentry->d_alias));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 if (dname_external(dentry))
223 kfree(dentry->d_name.name);
224 kmem_cache_free(dentry_cache, dentry);
225}
226
227/*
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100228 * no locks, please.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229 */
230static void d_free(struct dentry *dentry)
231{
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100232 BUG_ON(dentry->d_count);
Nick Piggin3e880fb2011-01-07 17:49:19 +1100233 this_cpu_dec(nr_dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 if (dentry->d_op && dentry->d_op->d_release)
235 dentry->d_op->d_release(dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400236
Linus Torvaldsdea36672011-04-24 07:58:46 -0700237 /* if dentry was never visible to RCU, immediate free is OK */
238 if (!(dentry->d_flags & DCACHE_RCUACCESS))
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400239 __d_free(&dentry->d_u.d_rcu);
Eric Dumazetb3423412006-12-06 20:38:48 -0800240 else
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400241 call_rcu(&dentry->d_u.d_rcu, __d_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242}
243
Nick Piggin31e6b012011-01-07 17:49:52 +1100244/**
245 * dentry_rcuwalk_barrier - invalidate in-progress rcu-walk lookups
Randy Dunlapff5fdb62011-01-22 20:16:06 -0800246 * @dentry: the target dentry
Nick Piggin31e6b012011-01-07 17:49:52 +1100247 * After this call, in-progress rcu-walk path lookup will fail. This
248 * should be called after unhashing, and after changing d_inode (if
249 * the dentry has not already been unhashed).
250 */
251static inline void dentry_rcuwalk_barrier(struct dentry *dentry)
252{
253 assert_spin_locked(&dentry->d_lock);
254 /* Go through a barrier */
255 write_seqcount_barrier(&dentry->d_seq);
256}
257
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258/*
259 * Release the dentry's inode, using the filesystem
Nick Piggin31e6b012011-01-07 17:49:52 +1100260 * d_iput() operation if defined. Dentry has no refcount
261 * and is unhashed.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 */
Arjan van de Ven858119e2006-01-14 13:20:43 -0800263static void dentry_iput(struct dentry * dentry)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200264 __releases(dentry->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100265 __releases(dentry->d_inode->i_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266{
267 struct inode *inode = dentry->d_inode;
268 if (inode) {
269 dentry->d_inode = NULL;
Al Virob3d9b7a2012-06-09 13:51:19 -0400270 hlist_del_init(&dentry->d_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100272 spin_unlock(&inode->i_lock);
Linus Torvaldsf805fbd2005-09-19 19:54:29 -0700273 if (!inode->i_nlink)
274 fsnotify_inoderemove(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 if (dentry->d_op && dentry->d_op->d_iput)
276 dentry->d_op->d_iput(dentry, inode);
277 else
278 iput(inode);
279 } else {
280 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 }
282}
283
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700284/*
Nick Piggin31e6b012011-01-07 17:49:52 +1100285 * Release the dentry's inode, using the filesystem
286 * d_iput() operation if defined. dentry remains in-use.
287 */
288static void dentry_unlink_inode(struct dentry * dentry)
289 __releases(dentry->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100290 __releases(dentry->d_inode->i_lock)
Nick Piggin31e6b012011-01-07 17:49:52 +1100291{
292 struct inode *inode = dentry->d_inode;
293 dentry->d_inode = NULL;
Al Virob3d9b7a2012-06-09 13:51:19 -0400294 hlist_del_init(&dentry->d_alias);
Nick Piggin31e6b012011-01-07 17:49:52 +1100295 dentry_rcuwalk_barrier(dentry);
296 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100297 spin_unlock(&inode->i_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +1100298 if (!inode->i_nlink)
299 fsnotify_inoderemove(inode);
300 if (dentry->d_op && dentry->d_op->d_iput)
301 dentry->d_op->d_iput(dentry, inode);
302 else
303 iput(inode);
304}
305
306/*
Sage Weilf0023bc2011-10-28 10:02:42 -0700307 * dentry_lru_(add|del|prune|move_tail) must be called with d_lock held.
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700308 */
309static void dentry_lru_add(struct dentry *dentry)
310{
Christoph Hellwiga4633352010-10-10 05:36:26 -0400311 if (list_empty(&dentry->d_lru)) {
Nick Piggin23044502011-01-07 17:49:31 +1100312 spin_lock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400313 list_add(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
314 dentry->d_sb->s_nr_dentry_unused++;
Nick Piggin86c87492011-01-07 17:49:18 +1100315 dentry_stat.nr_unused++;
Nick Piggin23044502011-01-07 17:49:31 +1100316 spin_unlock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400317 }
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700318}
319
Nick Piggin23044502011-01-07 17:49:31 +1100320static void __dentry_lru_del(struct dentry *dentry)
321{
322 list_del_init(&dentry->d_lru);
Miklos Szeredieaf5f902012-01-10 18:22:25 +0100323 dentry->d_flags &= ~DCACHE_SHRINK_LIST;
Nick Piggin23044502011-01-07 17:49:31 +1100324 dentry->d_sb->s_nr_dentry_unused--;
325 dentry_stat.nr_unused--;
326}
327
Sage Weilf0023bc2011-10-28 10:02:42 -0700328/*
329 * Remove a dentry with references from the LRU.
330 */
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700331static void dentry_lru_del(struct dentry *dentry)
332{
333 if (!list_empty(&dentry->d_lru)) {
Nick Piggin23044502011-01-07 17:49:31 +1100334 spin_lock(&dcache_lru_lock);
335 __dentry_lru_del(dentry);
336 spin_unlock(&dcache_lru_lock);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700337 }
338}
339
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000340static void dentry_lru_move_list(struct dentry *dentry, struct list_head *list)
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700341{
Nick Piggin23044502011-01-07 17:49:31 +1100342 spin_lock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400343 if (list_empty(&dentry->d_lru)) {
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000344 list_add_tail(&dentry->d_lru, list);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400345 dentry->d_sb->s_nr_dentry_unused++;
Nick Piggin86c87492011-01-07 17:49:18 +1100346 dentry_stat.nr_unused++;
Christoph Hellwiga4633352010-10-10 05:36:26 -0400347 } else {
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000348 list_move_tail(&dentry->d_lru, list);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700349 }
Nick Piggin23044502011-01-07 17:49:31 +1100350 spin_unlock(&dcache_lru_lock);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700351}
352
Miklos Szeredid52b9082007-05-08 00:23:46 -0700353/**
354 * d_kill - kill dentry and return parent
355 * @dentry: dentry to kill
Randy Dunlapff5fdb62011-01-22 20:16:06 -0800356 * @parent: parent dentry
Miklos Szeredid52b9082007-05-08 00:23:46 -0700357 *
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200358 * The dentry must already be unhashed and removed from the LRU.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700359 *
360 * If this is the root of the dentry tree, return NULL.
Nick Piggin23044502011-01-07 17:49:31 +1100361 *
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100362 * dentry->d_lock and parent->d_lock must be held by caller, and are dropped by
363 * d_kill.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700364 */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100365static struct dentry *d_kill(struct dentry *dentry, struct dentry *parent)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200366 __releases(dentry->d_lock)
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100367 __releases(parent->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100368 __releases(dentry->d_inode->i_lock)
Miklos Szeredid52b9082007-05-08 00:23:46 -0700369{
Miklos Szeredid52b9082007-05-08 00:23:46 -0700370 list_del(&dentry->d_u.d_child);
Trond Myklebustc83ce982011-03-15 13:36:43 -0400371 /*
372 * Inform try_to_ascend() that we are no longer attached to the
373 * dentry tree
374 */
Miklos Szeredib161dfa62012-09-17 22:31:38 +0200375 dentry->d_flags |= DCACHE_DENTRY_KILLED;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100376 if (parent)
377 spin_unlock(&parent->d_lock);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700378 dentry_iput(dentry);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100379 /*
380 * dentry_iput drops the locks, at which point nobody (except
381 * transient RCU lookups) can reach this dentry.
382 */
Miklos Szeredid52b9082007-05-08 00:23:46 -0700383 d_free(dentry);
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900384 return parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700385}
386
David Howellsc6627c62011-06-07 14:09:20 +0100387/*
388 * Unhash a dentry without inserting an RCU walk barrier or checking that
389 * dentry->d_lock is locked. The caller must take care of that, if
390 * appropriate.
391 */
392static void __d_shrink(struct dentry *dentry)
393{
394 if (!d_unhashed(dentry)) {
395 struct hlist_bl_head *b;
396 if (unlikely(dentry->d_flags & DCACHE_DISCONNECTED))
397 b = &dentry->d_sb->s_anon;
398 else
399 b = d_hash(dentry->d_parent, dentry->d_name.hash);
400
401 hlist_bl_lock(b);
402 __hlist_bl_del(&dentry->d_hash);
403 dentry->d_hash.pprev = NULL;
404 hlist_bl_unlock(b);
405 }
406}
407
Nick Piggin789680d2011-01-07 17:49:30 +1100408/**
409 * d_drop - drop a dentry
410 * @dentry: dentry to drop
411 *
412 * d_drop() unhashes the entry from the parent dentry hashes, so that it won't
413 * be found through a VFS lookup any more. Note that this is different from
414 * deleting the dentry - d_delete will try to mark the dentry negative if
415 * possible, giving a successful _negative_ lookup, while d_drop will
416 * just make the cache lookup fail.
417 *
418 * d_drop() is used mainly for stuff that wants to invalidate a dentry for some
419 * reason (NFS timeouts or autofs deletes).
420 *
421 * __d_drop requires dentry->d_lock.
422 */
423void __d_drop(struct dentry *dentry)
424{
Linus Torvaldsdea36672011-04-24 07:58:46 -0700425 if (!d_unhashed(dentry)) {
David Howellsc6627c62011-06-07 14:09:20 +0100426 __d_shrink(dentry);
Linus Torvaldsdea36672011-04-24 07:58:46 -0700427 dentry_rcuwalk_barrier(dentry);
Nick Piggin789680d2011-01-07 17:49:30 +1100428 }
429}
430EXPORT_SYMBOL(__d_drop);
431
432void d_drop(struct dentry *dentry)
433{
Nick Piggin789680d2011-01-07 17:49:30 +1100434 spin_lock(&dentry->d_lock);
435 __d_drop(dentry);
436 spin_unlock(&dentry->d_lock);
Nick Piggin789680d2011-01-07 17:49:30 +1100437}
438EXPORT_SYMBOL(d_drop);
439
Nick Piggin77812a12011-01-07 17:49:48 +1100440/*
441 * Finish off a dentry we've decided to kill.
442 * dentry->d_lock must be held, returns with it unlocked.
443 * If ref is non-zero, then decrement the refcount too.
444 * Returns dentry requiring refcount drop, or NULL if we're done.
445 */
446static inline struct dentry *dentry_kill(struct dentry *dentry, int ref)
447 __releases(dentry->d_lock)
448{
Nick Piggin873feea2011-01-07 17:50:06 +1100449 struct inode *inode;
Nick Piggin77812a12011-01-07 17:49:48 +1100450 struct dentry *parent;
451
Nick Piggin873feea2011-01-07 17:50:06 +1100452 inode = dentry->d_inode;
453 if (inode && !spin_trylock(&inode->i_lock)) {
Nick Piggin77812a12011-01-07 17:49:48 +1100454relock:
455 spin_unlock(&dentry->d_lock);
456 cpu_relax();
457 return dentry; /* try again with same dentry */
458 }
459 if (IS_ROOT(dentry))
460 parent = NULL;
461 else
462 parent = dentry->d_parent;
463 if (parent && !spin_trylock(&parent->d_lock)) {
Nick Piggin873feea2011-01-07 17:50:06 +1100464 if (inode)
465 spin_unlock(&inode->i_lock);
Nick Piggin77812a12011-01-07 17:49:48 +1100466 goto relock;
467 }
Nick Piggin31e6b012011-01-07 17:49:52 +1100468
Nick Piggin77812a12011-01-07 17:49:48 +1100469 if (ref)
470 dentry->d_count--;
Sage Weilf0023bc2011-10-28 10:02:42 -0700471 /*
Sage Weilf0023bc2011-10-28 10:02:42 -0700472 * inform the fs via d_prune that this dentry is about to be
473 * unhashed and destroyed.
474 */
Yan, Zheng61572bb2013-04-15 14:13:21 +0800475 if (dentry->d_flags & DCACHE_OP_PRUNE)
476 dentry->d_op->d_prune(dentry);
477
478 dentry_lru_del(dentry);
Nick Piggin77812a12011-01-07 17:49:48 +1100479 /* if it was on the hash then remove it */
480 __d_drop(dentry);
481 return d_kill(dentry, parent);
482}
483
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484/*
485 * This is dput
486 *
487 * This is complicated by the fact that we do not want to put
488 * dentries that are no longer on any hash chain on the unused
489 * list: we'd much rather just get rid of them immediately.
490 *
491 * However, that implies that we have to traverse the dentry
492 * tree upwards to the parents which might _also_ now be
493 * scheduled for deletion (it may have been only waiting for
494 * its last child to go away).
495 *
496 * This tail recursion is done by hand as we don't want to depend
497 * on the compiler to always get this right (gcc generally doesn't).
498 * Real recursion would eat up our stack space.
499 */
500
501/*
502 * dput - release a dentry
503 * @dentry: dentry to release
504 *
505 * Release a dentry. This will drop the usage count and if appropriate
506 * call the dentry unlink method as well as removing it from the queues and
507 * releasing its resources. If the parent dentries were scheduled for release
508 * they too may now get deleted.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510void dput(struct dentry *dentry)
511{
512 if (!dentry)
513 return;
514
515repeat:
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100516 if (dentry->d_count == 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700517 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518 spin_lock(&dentry->d_lock);
Nick Piggin61f3dee2011-01-07 17:49:40 +1100519 BUG_ON(!dentry->d_count);
520 if (dentry->d_count > 1) {
521 dentry->d_count--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523 return;
524 }
525
Nick Pigginfb045ad2011-01-07 17:49:55 +1100526 if (dentry->d_flags & DCACHE_OP_DELETE) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527 if (dentry->d_op->d_delete(dentry))
Nick Piggin61f3dee2011-01-07 17:49:40 +1100528 goto kill_it;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700529 }
Nick Piggin265ac902010-10-10 05:36:24 -0400530
Linus Torvalds1da177e2005-04-16 15:20:36 -0700531 /* Unreachable? Get rid of it */
532 if (d_unhashed(dentry))
533 goto kill_it;
Nick Piggin265ac902010-10-10 05:36:24 -0400534
Jeff Layton39e3c952012-11-28 11:30:53 -0500535 dentry->d_flags |= DCACHE_REFERENCED;
Christoph Hellwiga4633352010-10-10 05:36:26 -0400536 dentry_lru_add(dentry);
Nick Piggin265ac902010-10-10 05:36:24 -0400537
Nick Piggin61f3dee2011-01-07 17:49:40 +1100538 dentry->d_count--;
539 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540 return;
541
Miklos Szeredid52b9082007-05-08 00:23:46 -0700542kill_it:
Nick Piggin77812a12011-01-07 17:49:48 +1100543 dentry = dentry_kill(dentry, 1);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700544 if (dentry)
545 goto repeat;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700546}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700547EXPORT_SYMBOL(dput);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548
549/**
550 * d_invalidate - invalidate a dentry
551 * @dentry: dentry to invalidate
552 *
553 * Try to invalidate the dentry if it turns out to be
554 * possible. If there are other dentries that can be
555 * reached through this one we can't delete it and we
556 * return -EBUSY. On success we return 0.
557 *
558 * no dcache lock.
559 */
560
561int d_invalidate(struct dentry * dentry)
562{
563 /*
564 * If it's already been dropped, return OK.
565 */
Nick Pigginda502952011-01-07 17:49:33 +1100566 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 if (d_unhashed(dentry)) {
Nick Pigginda502952011-01-07 17:49:33 +1100568 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 return 0;
570 }
571 /*
572 * Check whether to do a partial shrink_dcache
573 * to get rid of unused child entries.
574 */
575 if (!list_empty(&dentry->d_subdirs)) {
Nick Pigginda502952011-01-07 17:49:33 +1100576 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 shrink_dcache_parent(dentry);
Nick Pigginda502952011-01-07 17:49:33 +1100578 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579 }
580
581 /*
582 * Somebody else still using it?
583 *
584 * If it's a directory, we can't drop it
585 * for fear of somebody re-populating it
586 * with children (even though dropping it
587 * would make it unreachable from the root,
588 * we might still populate it if it was a
589 * working directory or similar).
Al Viro50e69632011-11-07 16:39:57 +0000590 * We also need to leave mountpoints alone,
591 * directory or not.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592 */
Al Viro50e69632011-11-07 16:39:57 +0000593 if (dentry->d_count > 1 && dentry->d_inode) {
594 if (S_ISDIR(dentry->d_inode->i_mode) || d_mountpoint(dentry)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596 return -EBUSY;
597 }
598 }
599
600 __d_drop(dentry);
601 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700602 return 0;
603}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700604EXPORT_SYMBOL(d_invalidate);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100606/* This must be called with d_lock held */
Nick Piggindc0474b2011-01-07 17:49:43 +1100607static inline void __dget_dlock(struct dentry *dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608{
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100609 dentry->d_count++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610}
611
Nick Piggindc0474b2011-01-07 17:49:43 +1100612static inline void __dget(struct dentry *dentry)
Nick Piggin23044502011-01-07 17:49:31 +1100613{
Nick Piggin23044502011-01-07 17:49:31 +1100614 spin_lock(&dentry->d_lock);
Nick Piggindc0474b2011-01-07 17:49:43 +1100615 __dget_dlock(dentry);
Nick Piggin23044502011-01-07 17:49:31 +1100616 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100617}
618
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100619struct dentry *dget_parent(struct dentry *dentry)
620{
621 struct dentry *ret;
622
623repeat:
Nick Piggina734eb42011-01-07 17:49:44 +1100624 /*
625 * Don't need rcu_dereference because we re-check it was correct under
626 * the lock.
627 */
628 rcu_read_lock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100629 ret = dentry->d_parent;
Nick Piggina734eb42011-01-07 17:49:44 +1100630 spin_lock(&ret->d_lock);
631 if (unlikely(ret != dentry->d_parent)) {
632 spin_unlock(&ret->d_lock);
633 rcu_read_unlock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100634 goto repeat;
635 }
Nick Piggina734eb42011-01-07 17:49:44 +1100636 rcu_read_unlock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100637 BUG_ON(!ret->d_count);
638 ret->d_count++;
639 spin_unlock(&ret->d_lock);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100640 return ret;
641}
642EXPORT_SYMBOL(dget_parent);
643
Linus Torvalds1da177e2005-04-16 15:20:36 -0700644/**
645 * d_find_alias - grab a hashed alias of inode
646 * @inode: inode in question
Linus Torvalds32ba9c32012-06-08 10:34:03 -0700647 * @want_discon: flag, used by d_splice_alias, to request
648 * that only a DISCONNECTED alias be returned.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700649 *
650 * If inode has a hashed alias, or is a directory and has any alias,
651 * acquire the reference to alias and return it. Otherwise return NULL.
652 * Notice that if inode is a directory there can be only one alias and
653 * it can be unhashed only if it has no children, or if it is the root
654 * of a filesystem.
655 *
NeilBrown21c0d8f2006-10-04 02:16:16 -0700656 * If the inode has an IS_ROOT, DCACHE_DISCONNECTED alias, then prefer
Linus Torvalds32ba9c32012-06-08 10:34:03 -0700657 * any other hashed alias over that one unless @want_discon is set,
658 * in which case only return an IS_ROOT, DCACHE_DISCONNECTED alias.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700659 */
Linus Torvalds32ba9c32012-06-08 10:34:03 -0700660static struct dentry *__d_find_alias(struct inode *inode, int want_discon)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661{
Nick Pigginda502952011-01-07 17:49:33 +1100662 struct dentry *alias, *discon_alias;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700663
Nick Pigginda502952011-01-07 17:49:33 +1100664again:
665 discon_alias = NULL;
Sasha Levinb67bfe02013-02-27 17:06:00 -0800666 hlist_for_each_entry(alias, &inode->i_dentry, d_alias) {
Nick Pigginda502952011-01-07 17:49:33 +1100667 spin_lock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700668 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
NeilBrown21c0d8f2006-10-04 02:16:16 -0700669 if (IS_ROOT(alias) &&
Nick Pigginda502952011-01-07 17:49:33 +1100670 (alias->d_flags & DCACHE_DISCONNECTED)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700671 discon_alias = alias;
Linus Torvalds32ba9c32012-06-08 10:34:03 -0700672 } else if (!want_discon) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100673 __dget_dlock(alias);
Nick Pigginda502952011-01-07 17:49:33 +1100674 spin_unlock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 return alias;
676 }
677 }
Nick Pigginda502952011-01-07 17:49:33 +1100678 spin_unlock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700679 }
Nick Pigginda502952011-01-07 17:49:33 +1100680 if (discon_alias) {
681 alias = discon_alias;
682 spin_lock(&alias->d_lock);
683 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
684 if (IS_ROOT(alias) &&
685 (alias->d_flags & DCACHE_DISCONNECTED)) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100686 __dget_dlock(alias);
Nick Pigginda502952011-01-07 17:49:33 +1100687 spin_unlock(&alias->d_lock);
688 return alias;
689 }
690 }
691 spin_unlock(&alias->d_lock);
692 goto again;
693 }
694 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700695}
696
Nick Pigginda502952011-01-07 17:49:33 +1100697struct dentry *d_find_alias(struct inode *inode)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698{
David Howells214fda12006-03-25 03:06:36 -0800699 struct dentry *de = NULL;
700
Al Virob3d9b7a2012-06-09 13:51:19 -0400701 if (!hlist_empty(&inode->i_dentry)) {
Nick Piggin873feea2011-01-07 17:50:06 +1100702 spin_lock(&inode->i_lock);
Linus Torvalds32ba9c32012-06-08 10:34:03 -0700703 de = __d_find_alias(inode, 0);
Nick Piggin873feea2011-01-07 17:50:06 +1100704 spin_unlock(&inode->i_lock);
David Howells214fda12006-03-25 03:06:36 -0800705 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700706 return de;
707}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700708EXPORT_SYMBOL(d_find_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700709
710/*
711 * Try to kill dentries associated with this inode.
712 * WARNING: you must own a reference to inode.
713 */
714void d_prune_aliases(struct inode *inode)
715{
Domen Puncer0cdca3f2005-09-10 00:27:07 -0700716 struct dentry *dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717restart:
Nick Piggin873feea2011-01-07 17:50:06 +1100718 spin_lock(&inode->i_lock);
Sasha Levinb67bfe02013-02-27 17:06:00 -0800719 hlist_for_each_entry(dentry, &inode->i_dentry, d_alias) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720 spin_lock(&dentry->d_lock);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100721 if (!dentry->d_count) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100722 __dget_dlock(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700723 __d_drop(dentry);
724 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100725 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700726 dput(dentry);
727 goto restart;
728 }
729 spin_unlock(&dentry->d_lock);
730 }
Nick Piggin873feea2011-01-07 17:50:06 +1100731 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700733EXPORT_SYMBOL(d_prune_aliases);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700734
735/*
Nick Piggin77812a12011-01-07 17:49:48 +1100736 * Try to throw away a dentry - free the inode, dput the parent.
737 * Requires dentry->d_lock is held, and dentry->d_count == 0.
738 * Releases dentry->d_lock.
Andrew Mortond702ccb2006-06-22 14:47:31 -0700739 *
Nick Piggin77812a12011-01-07 17:49:48 +1100740 * This may fail if locks cannot be acquired no problem, just try again.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700741 */
Nick Piggin77812a12011-01-07 17:49:48 +1100742static void try_prune_one_dentry(struct dentry *dentry)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200743 __releases(dentry->d_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744{
Nick Piggin77812a12011-01-07 17:49:48 +1100745 struct dentry *parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700746
Nick Piggin77812a12011-01-07 17:49:48 +1100747 parent = dentry_kill(dentry, 0);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700748 /*
Nick Piggin77812a12011-01-07 17:49:48 +1100749 * If dentry_kill returns NULL, we have nothing more to do.
750 * if it returns the same dentry, trylocks failed. In either
751 * case, just loop again.
752 *
753 * Otherwise, we need to prune ancestors too. This is necessary
754 * to prevent quadratic behavior of shrink_dcache_parent(), but
755 * is also expected to be beneficial in reducing dentry cache
756 * fragmentation.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700757 */
Nick Piggin77812a12011-01-07 17:49:48 +1100758 if (!parent)
759 return;
760 if (parent == dentry)
761 return;
762
763 /* Prune ancestors. */
764 dentry = parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700765 while (dentry) {
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100766 spin_lock(&dentry->d_lock);
Nick Piggin89e60542011-01-07 17:49:45 +1100767 if (dentry->d_count > 1) {
768 dentry->d_count--;
769 spin_unlock(&dentry->d_lock);
770 return;
771 }
Nick Piggin77812a12011-01-07 17:49:48 +1100772 dentry = dentry_kill(dentry, 1);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700773 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774}
775
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400776static void shrink_dentry_list(struct list_head *list)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777{
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700778 struct dentry *dentry;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700779
Nick Pigginec336792011-01-07 17:49:47 +1100780 rcu_read_lock();
781 for (;;) {
Nick Pigginec336792011-01-07 17:49:47 +1100782 dentry = list_entry_rcu(list->prev, struct dentry, d_lru);
783 if (&dentry->d_lru == list)
784 break; /* empty */
785 spin_lock(&dentry->d_lock);
786 if (dentry != list_entry(list->prev, struct dentry, d_lru)) {
787 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100788 continue;
789 }
790
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791 /*
792 * We found an inuse dentry which was not removed from
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700793 * the LRU because of laziness during lookup. Do not free
794 * it - just keep it off the LRU list.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 */
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100796 if (dentry->d_count) {
Nick Pigginec336792011-01-07 17:49:47 +1100797 dentry_lru_del(dentry);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700798 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799 continue;
800 }
Nick Pigginec336792011-01-07 17:49:47 +1100801
Nick Pigginec336792011-01-07 17:49:47 +1100802 rcu_read_unlock();
Nick Piggin77812a12011-01-07 17:49:48 +1100803
804 try_prune_one_dentry(dentry);
805
Nick Pigginec336792011-01-07 17:49:47 +1100806 rcu_read_lock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807 }
Nick Pigginec336792011-01-07 17:49:47 +1100808 rcu_read_unlock();
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400809}
810
811/**
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000812 * prune_dcache_sb - shrink the dcache
813 * @sb: superblock
814 * @count: number of entries to try to free
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400815 *
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000816 * Attempt to shrink the superblock dcache LRU by @count entries. This is
817 * done when we need more memory an called from the superblock shrinker
818 * function.
819 *
820 * This function may fail to free any resources if all the dentries are in
821 * use.
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400822 */
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000823void prune_dcache_sb(struct super_block *sb, int count)
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400824{
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400825 struct dentry *dentry;
826 LIST_HEAD(referenced);
827 LIST_HEAD(tmp);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400828
Nick Piggin23044502011-01-07 17:49:31 +1100829relock:
830 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400831 while (!list_empty(&sb->s_dentry_lru)) {
832 dentry = list_entry(sb->s_dentry_lru.prev,
833 struct dentry, d_lru);
834 BUG_ON(dentry->d_sb != sb);
835
Nick Piggin23044502011-01-07 17:49:31 +1100836 if (!spin_trylock(&dentry->d_lock)) {
837 spin_unlock(&dcache_lru_lock);
838 cpu_relax();
839 goto relock;
840 }
841
Dave Chinnerb48f03b2011-08-23 18:56:24 +1000842 if (dentry->d_flags & DCACHE_REFERENCED) {
Nick Piggin23044502011-01-07 17:49:31 +1100843 dentry->d_flags &= ~DCACHE_REFERENCED;
844 list_move(&dentry->d_lru, &referenced);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400845 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100846 } else {
847 list_move_tail(&dentry->d_lru, &tmp);
Miklos Szeredieaf5f902012-01-10 18:22:25 +0100848 dentry->d_flags |= DCACHE_SHRINK_LIST;
Nick Piggin23044502011-01-07 17:49:31 +1100849 spin_unlock(&dentry->d_lock);
Dave Chinnerb0d40c92011-07-08 14:14:42 +1000850 if (!--count)
Nick Piggin23044502011-01-07 17:49:31 +1100851 break;
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400852 }
Nick Pigginec336792011-01-07 17:49:47 +1100853 cond_resched_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400854 }
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700855 if (!list_empty(&referenced))
856 list_splice(&referenced, &sb->s_dentry_lru);
Nick Piggin23044502011-01-07 17:49:31 +1100857 spin_unlock(&dcache_lru_lock);
Nick Pigginec336792011-01-07 17:49:47 +1100858
859 shrink_dentry_list(&tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700860}
861
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700862/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863 * shrink_dcache_sb - shrink dcache for a superblock
864 * @sb: superblock
865 *
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400866 * Shrink the dcache for the specified super block. This is used to free
867 * the dcache before unmounting a file system.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868 */
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400869void shrink_dcache_sb(struct super_block *sb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700870{
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400871 LIST_HEAD(tmp);
872
Nick Piggin23044502011-01-07 17:49:31 +1100873 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400874 while (!list_empty(&sb->s_dentry_lru)) {
875 list_splice_init(&sb->s_dentry_lru, &tmp);
Nick Pigginec336792011-01-07 17:49:47 +1100876 spin_unlock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400877 shrink_dentry_list(&tmp);
Nick Pigginec336792011-01-07 17:49:47 +1100878 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400879 }
Nick Piggin23044502011-01-07 17:49:31 +1100880 spin_unlock(&dcache_lru_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700881}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700882EXPORT_SYMBOL(shrink_dcache_sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883
884/*
David Howellsc636ebd2006-10-11 01:22:19 -0700885 * destroy a single subtree of dentries for unmount
886 * - see the comments on shrink_dcache_for_umount() for a description of the
887 * locking
888 */
889static void shrink_dcache_for_umount_subtree(struct dentry *dentry)
890{
891 struct dentry *parent;
892
893 BUG_ON(!IS_ROOT(dentry));
894
David Howellsc636ebd2006-10-11 01:22:19 -0700895 for (;;) {
896 /* descend to the first leaf in the current subtree */
David Howells43c1c9c2011-06-07 14:09:30 +0100897 while (!list_empty(&dentry->d_subdirs))
David Howellsc636ebd2006-10-11 01:22:19 -0700898 dentry = list_entry(dentry->d_subdirs.next,
899 struct dentry, d_u.d_child);
David Howellsc636ebd2006-10-11 01:22:19 -0700900
901 /* consume the dentries from this leaf up through its parents
902 * until we find one with children or run out altogether */
903 do {
904 struct inode *inode;
905
Sage Weilf0023bc2011-10-28 10:02:42 -0700906 /*
Yan, Zheng61572bb2013-04-15 14:13:21 +0800907 * inform the fs that this dentry is about to be
Sage Weilf0023bc2011-10-28 10:02:42 -0700908 * unhashed and destroyed.
909 */
Yan, Zheng61572bb2013-04-15 14:13:21 +0800910 if (dentry->d_flags & DCACHE_OP_PRUNE)
911 dentry->d_op->d_prune(dentry);
912
913 dentry_lru_del(dentry);
David Howells43c1c9c2011-06-07 14:09:30 +0100914 __d_shrink(dentry);
915
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100916 if (dentry->d_count != 0) {
David Howellsc636ebd2006-10-11 01:22:19 -0700917 printk(KERN_ERR
918 "BUG: Dentry %p{i=%lx,n=%s}"
919 " still in use (%d)"
920 " [unmount of %s %s]\n",
921 dentry,
922 dentry->d_inode ?
923 dentry->d_inode->i_ino : 0UL,
924 dentry->d_name.name,
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100925 dentry->d_count,
David Howellsc636ebd2006-10-11 01:22:19 -0700926 dentry->d_sb->s_type->name,
927 dentry->d_sb->s_id);
928 BUG();
929 }
930
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100931 if (IS_ROOT(dentry)) {
David Howellsc636ebd2006-10-11 01:22:19 -0700932 parent = NULL;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100933 list_del(&dentry->d_u.d_child);
934 } else {
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900935 parent = dentry->d_parent;
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100936 parent->d_count--;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100937 list_del(&dentry->d_u.d_child);
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900938 }
David Howellsc636ebd2006-10-11 01:22:19 -0700939
David Howellsc636ebd2006-10-11 01:22:19 -0700940 inode = dentry->d_inode;
941 if (inode) {
942 dentry->d_inode = NULL;
Al Virob3d9b7a2012-06-09 13:51:19 -0400943 hlist_del_init(&dentry->d_alias);
David Howellsc636ebd2006-10-11 01:22:19 -0700944 if (dentry->d_op && dentry->d_op->d_iput)
945 dentry->d_op->d_iput(dentry, inode);
946 else
947 iput(inode);
948 }
949
950 d_free(dentry);
951
952 /* finished when we fall off the top of the tree,
953 * otherwise we ascend to the parent and move to the
954 * next sibling if there is one */
955 if (!parent)
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400956 return;
David Howellsc636ebd2006-10-11 01:22:19 -0700957 dentry = parent;
David Howellsc636ebd2006-10-11 01:22:19 -0700958 } while (list_empty(&dentry->d_subdirs));
959
960 dentry = list_entry(dentry->d_subdirs.next,
961 struct dentry, d_u.d_child);
962 }
963}
964
965/*
966 * destroy the dentries attached to a superblock on unmounting
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100967 * - we don't need to use dentry->d_lock because:
David Howellsc636ebd2006-10-11 01:22:19 -0700968 * - the superblock is detached from all mountings and open files, so the
969 * dentry trees will not be rearranged by the VFS
970 * - s_umount is write-locked, so the memory pressure shrinker will ignore
971 * any dentries belonging to this superblock that it comes across
972 * - the filesystem itself is no longer permitted to rearrange the dentries
973 * in this superblock
974 */
975void shrink_dcache_for_umount(struct super_block *sb)
976{
977 struct dentry *dentry;
978
979 if (down_read_trylock(&sb->s_umount))
980 BUG();
981
982 dentry = sb->s_root;
983 sb->s_root = NULL;
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100984 dentry->d_count--;
David Howellsc636ebd2006-10-11 01:22:19 -0700985 shrink_dcache_for_umount_subtree(dentry);
986
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100987 while (!hlist_bl_empty(&sb->s_anon)) {
988 dentry = hlist_bl_entry(hlist_bl_first(&sb->s_anon), struct dentry, d_hash);
David Howellsc636ebd2006-10-11 01:22:19 -0700989 shrink_dcache_for_umount_subtree(dentry);
990 }
991}
992
993/*
Linus Torvaldsc826cb72011-03-15 15:29:21 -0700994 * This tries to ascend one level of parenthood, but
995 * we can race with renaming, so we need to re-check
996 * the parenthood after dropping the lock and check
997 * that the sequence number still matches.
998 */
999static struct dentry *try_to_ascend(struct dentry *old, int locked, unsigned seq)
1000{
1001 struct dentry *new = old->d_parent;
1002
1003 rcu_read_lock();
1004 spin_unlock(&old->d_lock);
1005 spin_lock(&new->d_lock);
1006
1007 /*
1008 * might go back up the wrong parent if we have had a rename
1009 * or deletion
1010 */
1011 if (new != old->d_parent ||
Miklos Szeredib161dfa62012-09-17 22:31:38 +02001012 (old->d_flags & DCACHE_DENTRY_KILLED) ||
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001013 (!locked && read_seqretry(&rename_lock, seq))) {
1014 spin_unlock(&new->d_lock);
1015 new = NULL;
1016 }
1017 rcu_read_unlock();
1018 return new;
1019}
1020
1021
1022/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001023 * Search for at least 1 mount point in the dentry's subdirs.
1024 * We descend to the next level whenever the d_subdirs
1025 * list is non-empty and continue searching.
1026 */
1027
1028/**
1029 * have_submounts - check for mounts over a dentry
1030 * @parent: dentry to check.
1031 *
1032 * Return true if the parent or its subdirectories contain
1033 * a mount point
1034 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035int have_submounts(struct dentry *parent)
1036{
Nick Piggin949854d2011-01-07 17:49:37 +11001037 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001038 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11001039 unsigned seq;
Nick Piggin58db63d2011-01-07 17:49:39 +11001040 int locked = 0;
Nick Piggin949854d2011-01-07 17:49:37 +11001041
Nick Piggin949854d2011-01-07 17:49:37 +11001042 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001043again:
1044 this_parent = parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001045
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046 if (d_mountpoint(parent))
1047 goto positive;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001048 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001049repeat:
1050 next = this_parent->d_subdirs.next;
1051resume:
1052 while (next != &this_parent->d_subdirs) {
1053 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08001054 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001055 next = tmp->next;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001056
1057 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001058 /* Have we found a mount point ? */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001059 if (d_mountpoint(dentry)) {
1060 spin_unlock(&dentry->d_lock);
1061 spin_unlock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062 goto positive;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001063 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001064 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001065 spin_unlock(&this_parent->d_lock);
1066 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001067 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001068 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001069 goto repeat;
1070 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001071 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001072 }
1073 /*
1074 * All done at this level ... ascend and resume the search.
1075 */
1076 if (this_parent != parent) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001077 struct dentry *child = this_parent;
1078 this_parent = try_to_ascend(this_parent, locked, seq);
1079 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11001080 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11001081 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001082 goto resume;
1083 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001084 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001085 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001086 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001087 if (locked)
1088 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001089 return 0; /* No mount points found in tree */
1090positive:
Nick Piggin58db63d2011-01-07 17:49:39 +11001091 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001092 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001093 if (locked)
1094 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001095 return 1;
Nick Piggin58db63d2011-01-07 17:49:39 +11001096
1097rename_retry:
Miklos Szeredi8110e162012-09-17 22:23:30 +02001098 if (locked)
1099 goto again;
Nick Piggin58db63d2011-01-07 17:49:39 +11001100 locked = 1;
1101 write_seqlock(&rename_lock);
1102 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001103}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001104EXPORT_SYMBOL(have_submounts);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001105
1106/*
J. Bruce Fieldsfd517902012-09-18 16:35:51 -04001107 * Search the dentry child list of the specified parent,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001108 * and move any unused dentries to the end of the unused
1109 * list for prune_dcache(). We descend to the next level
1110 * whenever the d_subdirs list is non-empty and continue
1111 * searching.
1112 *
1113 * It returns zero iff there are no unused children,
1114 * otherwise it returns the number of children moved to
1115 * the end of the unused list. This may not be the total
1116 * number of unused children, because select_parent can
1117 * drop the lock and return early due to latency
1118 * constraints.
1119 */
Dave Chinnerb48f03b2011-08-23 18:56:24 +10001120static int select_parent(struct dentry *parent, struct list_head *dispose)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001121{
Nick Piggin949854d2011-01-07 17:49:37 +11001122 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001123 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11001124 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001125 int found = 0;
Nick Piggin58db63d2011-01-07 17:49:39 +11001126 int locked = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001127
Nick Piggin949854d2011-01-07 17:49:37 +11001128 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001129again:
1130 this_parent = parent;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001131 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001132repeat:
1133 next = this_parent->d_subdirs.next;
1134resume:
1135 while (next != &this_parent->d_subdirs) {
1136 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08001137 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001138 next = tmp->next;
1139
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001140 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Nick Piggin23044502011-01-07 17:49:31 +11001141
Dave Chinnerb48f03b2011-08-23 18:56:24 +10001142 /*
1143 * move only zero ref count dentries to the dispose list.
Miklos Szeredieaf5f902012-01-10 18:22:25 +01001144 *
1145 * Those which are presently on the shrink list, being processed
1146 * by shrink_dentry_list(), shouldn't be moved. Otherwise the
1147 * loop in shrink_dcache_parent() might not make any progress
1148 * and loop forever.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001149 */
Miklos Szeredieaf5f902012-01-10 18:22:25 +01001150 if (dentry->d_count) {
Christoph Hellwiga4633352010-10-10 05:36:26 -04001151 dentry_lru_del(dentry);
Miklos Szeredieaf5f902012-01-10 18:22:25 +01001152 } else if (!(dentry->d_flags & DCACHE_SHRINK_LIST)) {
1153 dentry_lru_move_list(dentry, dispose);
1154 dentry->d_flags |= DCACHE_SHRINK_LIST;
1155 found++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001156 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001157 /*
1158 * We can return to the caller if we have found some (this
1159 * ensures forward progress). We'll be coming back to find
1160 * the rest.
1161 */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001162 if (found && need_resched()) {
1163 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001164 goto out;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001165 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001166
1167 /*
1168 * Descend a level if the d_subdirs list is non-empty.
1169 */
1170 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001171 spin_unlock(&this_parent->d_lock);
1172 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001173 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001174 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001175 goto repeat;
1176 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001177
1178 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001179 }
1180 /*
1181 * All done at this level ... ascend and resume the search.
1182 */
1183 if (this_parent != parent) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001184 struct dentry *child = this_parent;
1185 this_parent = try_to_ascend(this_parent, locked, seq);
1186 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11001187 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11001188 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001189 goto resume;
1190 }
1191out:
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001192 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001193 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001194 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001195 if (locked)
1196 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001197 return found;
Nick Piggin58db63d2011-01-07 17:49:39 +11001198
1199rename_retry:
1200 if (found)
1201 return found;
Miklos Szeredi8110e162012-09-17 22:23:30 +02001202 if (locked)
1203 goto again;
Nick Piggin58db63d2011-01-07 17:49:39 +11001204 locked = 1;
1205 write_seqlock(&rename_lock);
1206 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001207}
1208
1209/**
1210 * shrink_dcache_parent - prune dcache
1211 * @parent: parent of entries to prune
1212 *
1213 * Prune the dcache to remove unused children of the parent dentry.
1214 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001215void shrink_dcache_parent(struct dentry * parent)
1216{
Dave Chinnerb48f03b2011-08-23 18:56:24 +10001217 LIST_HEAD(dispose);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001218 int found;
1219
Greg Thelen421348f2013-04-30 15:26:48 -07001220 while ((found = select_parent(parent, &dispose)) != 0) {
Dave Chinnerb48f03b2011-08-23 18:56:24 +10001221 shrink_dentry_list(&dispose);
Greg Thelen421348f2013-04-30 15:26:48 -07001222 cond_resched();
1223 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001225EXPORT_SYMBOL(shrink_dcache_parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001226
Linus Torvalds1da177e2005-04-16 15:20:36 -07001227/**
Al Viroa4464db2011-07-07 15:03:58 -04001228 * __d_alloc - allocate a dcache entry
1229 * @sb: filesystem it will belong to
Linus Torvalds1da177e2005-04-16 15:20:36 -07001230 * @name: qstr of the name
1231 *
1232 * Allocates a dentry. It returns %NULL if there is insufficient memory
1233 * available. On a success the dentry is returned. The name passed in is
1234 * copied and the copy passed in may be reused after this call.
1235 */
1236
Al Viroa4464db2011-07-07 15:03:58 -04001237struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001238{
1239 struct dentry *dentry;
1240 char *dname;
1241
Mel Gormane12ba742007-10-16 01:25:52 -07001242 dentry = kmem_cache_alloc(dentry_cache, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001243 if (!dentry)
1244 return NULL;
1245
Linus Torvalds6326c712012-05-21 16:14:04 -07001246 /*
1247 * We guarantee that the inline name is always NUL-terminated.
1248 * This way the memcpy() done by the name switching in rename
1249 * will still always have a NUL at the end, even if we might
1250 * be overwriting an internal NUL character
1251 */
1252 dentry->d_iname[DNAME_INLINE_LEN-1] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001253 if (name->len > DNAME_INLINE_LEN-1) {
1254 dname = kmalloc(name->len + 1, GFP_KERNEL);
1255 if (!dname) {
1256 kmem_cache_free(dentry_cache, dentry);
1257 return NULL;
1258 }
1259 } else {
1260 dname = dentry->d_iname;
1261 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001262
1263 dentry->d_name.len = name->len;
1264 dentry->d_name.hash = name->hash;
1265 memcpy(dname, name->name, name->len);
1266 dname[name->len] = 0;
1267
Linus Torvalds6326c712012-05-21 16:14:04 -07001268 /* Make sure we always see the terminating NUL character */
1269 smp_wmb();
1270 dentry->d_name.name = dname;
1271
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001272 dentry->d_count = 1;
Linus Torvaldsdea36672011-04-24 07:58:46 -07001273 dentry->d_flags = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001274 spin_lock_init(&dentry->d_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +11001275 seqcount_init(&dentry->d_seq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001276 dentry->d_inode = NULL;
Al Viroa4464db2011-07-07 15:03:58 -04001277 dentry->d_parent = dentry;
1278 dentry->d_sb = sb;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001279 dentry->d_op = NULL;
1280 dentry->d_fsdata = NULL;
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001281 INIT_HLIST_BL_NODE(&dentry->d_hash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001282 INIT_LIST_HEAD(&dentry->d_lru);
1283 INIT_LIST_HEAD(&dentry->d_subdirs);
Al Virob3d9b7a2012-06-09 13:51:19 -04001284 INIT_HLIST_NODE(&dentry->d_alias);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001285 INIT_LIST_HEAD(&dentry->d_u.d_child);
Al Viroa4464db2011-07-07 15:03:58 -04001286 d_set_d_op(dentry, dentry->d_sb->s_d_op);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001287
Nick Piggin3e880fb2011-01-07 17:49:19 +11001288 this_cpu_inc(nr_dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -04001289
Linus Torvalds1da177e2005-04-16 15:20:36 -07001290 return dentry;
1291}
Al Viroa4464db2011-07-07 15:03:58 -04001292
1293/**
1294 * d_alloc - allocate a dcache entry
1295 * @parent: parent of entry to allocate
1296 * @name: qstr of the name
1297 *
1298 * Allocates a dentry. It returns %NULL if there is insufficient memory
1299 * available. On a success the dentry is returned. The name passed in is
1300 * copied and the copy passed in may be reused after this call.
1301 */
1302struct dentry *d_alloc(struct dentry * parent, const struct qstr *name)
1303{
1304 struct dentry *dentry = __d_alloc(parent->d_sb, name);
1305 if (!dentry)
1306 return NULL;
1307
1308 spin_lock(&parent->d_lock);
1309 /*
1310 * don't need child lock because it is not subject
1311 * to concurrency here
1312 */
1313 __dget_dlock(parent);
1314 dentry->d_parent = parent;
1315 list_add(&dentry->d_u.d_child, &parent->d_subdirs);
1316 spin_unlock(&parent->d_lock);
1317
1318 return dentry;
1319}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001320EXPORT_SYMBOL(d_alloc);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001321
Nick Piggin4b936882011-01-07 17:50:07 +11001322struct dentry *d_alloc_pseudo(struct super_block *sb, const struct qstr *name)
1323{
Al Viroa4464db2011-07-07 15:03:58 -04001324 struct dentry *dentry = __d_alloc(sb, name);
1325 if (dentry)
Nick Piggin4b936882011-01-07 17:50:07 +11001326 dentry->d_flags |= DCACHE_DISCONNECTED;
Nick Piggin4b936882011-01-07 17:50:07 +11001327 return dentry;
1328}
1329EXPORT_SYMBOL(d_alloc_pseudo);
1330
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331struct dentry *d_alloc_name(struct dentry *parent, const char *name)
1332{
1333 struct qstr q;
1334
1335 q.name = name;
1336 q.len = strlen(name);
1337 q.hash = full_name_hash(q.name, q.len);
1338 return d_alloc(parent, &q);
1339}
H Hartley Sweetenef26ca92009-09-29 20:09:42 -04001340EXPORT_SYMBOL(d_alloc_name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001341
Nick Pigginfb045ad2011-01-07 17:49:55 +11001342void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op)
1343{
Linus Torvalds6f7f7ca2011-01-14 13:26:18 -08001344 WARN_ON_ONCE(dentry->d_op);
1345 WARN_ON_ONCE(dentry->d_flags & (DCACHE_OP_HASH |
Nick Pigginfb045ad2011-01-07 17:49:55 +11001346 DCACHE_OP_COMPARE |
1347 DCACHE_OP_REVALIDATE |
Jeff Laytonecf3d1f2013-02-20 11:19:05 -05001348 DCACHE_OP_WEAK_REVALIDATE |
Nick Pigginfb045ad2011-01-07 17:49:55 +11001349 DCACHE_OP_DELETE ));
1350 dentry->d_op = op;
1351 if (!op)
1352 return;
1353 if (op->d_hash)
1354 dentry->d_flags |= DCACHE_OP_HASH;
1355 if (op->d_compare)
1356 dentry->d_flags |= DCACHE_OP_COMPARE;
1357 if (op->d_revalidate)
1358 dentry->d_flags |= DCACHE_OP_REVALIDATE;
Jeff Laytonecf3d1f2013-02-20 11:19:05 -05001359 if (op->d_weak_revalidate)
1360 dentry->d_flags |= DCACHE_OP_WEAK_REVALIDATE;
Nick Pigginfb045ad2011-01-07 17:49:55 +11001361 if (op->d_delete)
1362 dentry->d_flags |= DCACHE_OP_DELETE;
Sage Weilf0023bc2011-10-28 10:02:42 -07001363 if (op->d_prune)
1364 dentry->d_flags |= DCACHE_OP_PRUNE;
Nick Pigginfb045ad2011-01-07 17:49:55 +11001365
1366}
1367EXPORT_SYMBOL(d_set_d_op);
1368
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001369static void __d_instantiate(struct dentry *dentry, struct inode *inode)
1370{
Nick Pigginb23fb0a2011-01-07 17:49:35 +11001371 spin_lock(&dentry->d_lock);
David Howells9875cf82011-01-14 18:45:21 +00001372 if (inode) {
1373 if (unlikely(IS_AUTOMOUNT(inode)))
1374 dentry->d_flags |= DCACHE_NEED_AUTOMOUNT;
Al Virob3d9b7a2012-06-09 13:51:19 -04001375 hlist_add_head(&dentry->d_alias, &inode->i_dentry);
David Howells9875cf82011-01-14 18:45:21 +00001376 }
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001377 dentry->d_inode = inode;
Nick Piggin31e6b012011-01-07 17:49:52 +11001378 dentry_rcuwalk_barrier(dentry);
Nick Pigginb23fb0a2011-01-07 17:49:35 +11001379 spin_unlock(&dentry->d_lock);
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001380 fsnotify_d_instantiate(dentry, inode);
1381}
1382
Linus Torvalds1da177e2005-04-16 15:20:36 -07001383/**
1384 * d_instantiate - fill in inode information for a dentry
1385 * @entry: dentry to complete
1386 * @inode: inode to attach to this dentry
1387 *
1388 * Fill in inode information in the entry.
1389 *
1390 * This turns negative dentries into productive full members
1391 * of society.
1392 *
1393 * NOTE! This assumes that the inode count has been incremented
1394 * (or otherwise set) by the caller to indicate that it is now
1395 * in use by the dcache.
1396 */
1397
1398void d_instantiate(struct dentry *entry, struct inode * inode)
1399{
Al Virob3d9b7a2012-06-09 13:51:19 -04001400 BUG_ON(!hlist_unhashed(&entry->d_alias));
Nick Piggin873feea2011-01-07 17:50:06 +11001401 if (inode)
1402 spin_lock(&inode->i_lock);
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001403 __d_instantiate(entry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001404 if (inode)
1405 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001406 security_d_instantiate(entry, inode);
1407}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001408EXPORT_SYMBOL(d_instantiate);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001409
1410/**
1411 * d_instantiate_unique - instantiate a non-aliased dentry
1412 * @entry: dentry to instantiate
1413 * @inode: inode to attach to this dentry
1414 *
1415 * Fill in inode information in the entry. On success, it returns NULL.
1416 * If an unhashed alias of "entry" already exists, then we return the
Oleg Drokine866cfa2006-01-09 20:52:51 -08001417 * aliased dentry instead and drop one reference to inode.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001418 *
1419 * Note that in order to avoid conflicts with rename() etc, the caller
1420 * had better be holding the parent directory semaphore.
Oleg Drokine866cfa2006-01-09 20:52:51 -08001421 *
1422 * This also assumes that the inode count has been incremented
1423 * (or otherwise set) by the caller to indicate that it is now
1424 * in use by the dcache.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001425 */
David Howells770bfad2006-08-22 20:06:07 -04001426static struct dentry *__d_instantiate_unique(struct dentry *entry,
1427 struct inode *inode)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001428{
1429 struct dentry *alias;
1430 int len = entry->d_name.len;
1431 const char *name = entry->d_name.name;
1432 unsigned int hash = entry->d_name.hash;
1433
David Howells770bfad2006-08-22 20:06:07 -04001434 if (!inode) {
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001435 __d_instantiate(entry, NULL);
David Howells770bfad2006-08-22 20:06:07 -04001436 return NULL;
1437 }
1438
Sasha Levinb67bfe02013-02-27 17:06:00 -08001439 hlist_for_each_entry(alias, &inode->i_dentry, d_alias) {
Nick Piggin9abca362011-01-07 17:49:36 +11001440 /*
1441 * Don't need alias->d_lock here, because aliases with
1442 * d_parent == entry->d_parent are not subject to name or
1443 * parent changes, because the parent inode i_mutex is held.
1444 */
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001445 if (alias->d_name.hash != hash)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001446 continue;
1447 if (alias->d_parent != entry->d_parent)
1448 continue;
Linus Torvaldsee983e82012-05-10 12:37:10 -07001449 if (alias->d_name.len != len)
1450 continue;
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001451 if (dentry_cmp(alias, name, len))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001452 continue;
Nick Piggindc0474b2011-01-07 17:49:43 +11001453 __dget(alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001454 return alias;
1455 }
David Howells770bfad2006-08-22 20:06:07 -04001456
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001457 __d_instantiate(entry, inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001458 return NULL;
1459}
David Howells770bfad2006-08-22 20:06:07 -04001460
1461struct dentry *d_instantiate_unique(struct dentry *entry, struct inode *inode)
1462{
1463 struct dentry *result;
1464
Al Virob3d9b7a2012-06-09 13:51:19 -04001465 BUG_ON(!hlist_unhashed(&entry->d_alias));
David Howells770bfad2006-08-22 20:06:07 -04001466
Nick Piggin873feea2011-01-07 17:50:06 +11001467 if (inode)
1468 spin_lock(&inode->i_lock);
David Howells770bfad2006-08-22 20:06:07 -04001469 result = __d_instantiate_unique(entry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001470 if (inode)
1471 spin_unlock(&inode->i_lock);
David Howells770bfad2006-08-22 20:06:07 -04001472
1473 if (!result) {
1474 security_d_instantiate(entry, inode);
1475 return NULL;
1476 }
1477
1478 BUG_ON(!d_unhashed(result));
1479 iput(inode);
1480 return result;
1481}
1482
Linus Torvalds1da177e2005-04-16 15:20:36 -07001483EXPORT_SYMBOL(d_instantiate_unique);
1484
Al Viroadc0e912012-01-08 16:49:21 -05001485struct dentry *d_make_root(struct inode *root_inode)
1486{
1487 struct dentry *res = NULL;
1488
1489 if (root_inode) {
Linus Torvalds26fe5752012-05-10 13:14:12 -07001490 static const struct qstr name = QSTR_INIT("/", 1);
Al Viroadc0e912012-01-08 16:49:21 -05001491
1492 res = __d_alloc(root_inode->i_sb, &name);
1493 if (res)
1494 d_instantiate(res, root_inode);
1495 else
1496 iput(root_inode);
1497 }
1498 return res;
1499}
1500EXPORT_SYMBOL(d_make_root);
1501
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001502static struct dentry * __d_find_any_alias(struct inode *inode)
1503{
1504 struct dentry *alias;
1505
Al Virob3d9b7a2012-06-09 13:51:19 -04001506 if (hlist_empty(&inode->i_dentry))
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001507 return NULL;
Al Virob3d9b7a2012-06-09 13:51:19 -04001508 alias = hlist_entry(inode->i_dentry.first, struct dentry, d_alias);
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001509 __dget(alias);
1510 return alias;
1511}
1512
Sage Weil46f72b32012-01-10 09:04:37 -08001513/**
1514 * d_find_any_alias - find any alias for a given inode
1515 * @inode: inode to find an alias for
1516 *
1517 * If any aliases exist for the given inode, take and return a
1518 * reference for one of them. If no aliases exist, return %NULL.
1519 */
1520struct dentry *d_find_any_alias(struct inode *inode)
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001521{
1522 struct dentry *de;
1523
1524 spin_lock(&inode->i_lock);
1525 de = __d_find_any_alias(inode);
1526 spin_unlock(&inode->i_lock);
1527 return de;
1528}
Sage Weil46f72b32012-01-10 09:04:37 -08001529EXPORT_SYMBOL(d_find_any_alias);
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001530
Linus Torvalds1da177e2005-04-16 15:20:36 -07001531/**
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001532 * d_obtain_alias - find or allocate a dentry for a given inode
1533 * @inode: inode to allocate the dentry for
1534 *
1535 * Obtain a dentry for an inode resulting from NFS filehandle conversion or
1536 * similar open by handle operations. The returned dentry may be anonymous,
1537 * or may have a full name (if the inode was already in the cache).
1538 *
1539 * When called on a directory inode, we must ensure that the inode only ever
1540 * has one dentry. If a dentry is found, that is returned instead of
1541 * allocating a new one.
1542 *
1543 * On successful return, the reference to the inode has been transferred
Christoph Hellwig44003722008-08-11 15:49:04 +02001544 * to the dentry. In case of an error the reference on the inode is released.
1545 * To make it easier to use in export operations a %NULL or IS_ERR inode may
1546 * be passed in and will be the error will be propagate to the return value,
1547 * with a %NULL @inode replaced by ERR_PTR(-ESTALE).
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001548 */
1549struct dentry *d_obtain_alias(struct inode *inode)
1550{
NeilBrownb911a6b2012-11-08 16:09:37 -08001551 static const struct qstr anonstring = QSTR_INIT("/", 1);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001552 struct dentry *tmp;
1553 struct dentry *res;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001554
1555 if (!inode)
Christoph Hellwig44003722008-08-11 15:49:04 +02001556 return ERR_PTR(-ESTALE);
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001557 if (IS_ERR(inode))
1558 return ERR_CAST(inode);
1559
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001560 res = d_find_any_alias(inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001561 if (res)
1562 goto out_iput;
1563
Al Viroa4464db2011-07-07 15:03:58 -04001564 tmp = __d_alloc(inode->i_sb, &anonstring);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001565 if (!tmp) {
1566 res = ERR_PTR(-ENOMEM);
1567 goto out_iput;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001568 }
Nick Pigginb5c84bf2011-01-07 17:49:38 +11001569
Nick Piggin873feea2011-01-07 17:50:06 +11001570 spin_lock(&inode->i_lock);
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001571 res = __d_find_any_alias(inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001572 if (res) {
Nick Piggin873feea2011-01-07 17:50:06 +11001573 spin_unlock(&inode->i_lock);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001574 dput(tmp);
1575 goto out_iput;
1576 }
1577
1578 /* attach a disconnected dentry */
1579 spin_lock(&tmp->d_lock);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001580 tmp->d_inode = inode;
1581 tmp->d_flags |= DCACHE_DISCONNECTED;
Al Virob3d9b7a2012-06-09 13:51:19 -04001582 hlist_add_head(&tmp->d_alias, &inode->i_dentry);
Christoph Hellwig1879fd62011-04-25 14:01:36 -04001583 hlist_bl_lock(&tmp->d_sb->s_anon);
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001584 hlist_bl_add_head(&tmp->d_hash, &tmp->d_sb->s_anon);
Christoph Hellwig1879fd62011-04-25 14:01:36 -04001585 hlist_bl_unlock(&tmp->d_sb->s_anon);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001586 spin_unlock(&tmp->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11001587 spin_unlock(&inode->i_lock);
Josef Bacik24ff6662010-11-18 20:52:55 -05001588 security_d_instantiate(tmp, inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001589
Christoph Hellwig9308a612008-08-11 15:49:12 +02001590 return tmp;
1591
1592 out_iput:
Josef Bacik24ff6662010-11-18 20:52:55 -05001593 if (res && !IS_ERR(res))
1594 security_d_instantiate(res, inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001595 iput(inode);
1596 return res;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001597}
Benny Halevyadc48722009-02-27 14:02:59 -08001598EXPORT_SYMBOL(d_obtain_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001599
1600/**
1601 * d_splice_alias - splice a disconnected dentry into the tree if one exists
1602 * @inode: the inode which may have a disconnected dentry
1603 * @dentry: a negative dentry which we want to point to the inode.
1604 *
1605 * If inode is a directory and has a 'disconnected' dentry (i.e. IS_ROOT and
1606 * DCACHE_DISCONNECTED), then d_move that in place of the given dentry
1607 * and return it, else simply d_add the inode to the dentry and return NULL.
1608 *
1609 * This is needed in the lookup routine of any filesystem that is exportable
1610 * (via knfsd) so that we can build dcache paths to directories effectively.
1611 *
1612 * If a dentry was found and moved, then it is returned. Otherwise NULL
1613 * is returned. This matches the expected return value of ->lookup.
1614 *
1615 */
1616struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry)
1617{
1618 struct dentry *new = NULL;
1619
Al Viroa9049372011-07-08 21:20:11 -04001620 if (IS_ERR(inode))
1621 return ERR_CAST(inode);
1622
NeilBrown21c0d8f2006-10-04 02:16:16 -07001623 if (inode && S_ISDIR(inode->i_mode)) {
Nick Piggin873feea2011-01-07 17:50:06 +11001624 spin_lock(&inode->i_lock);
Linus Torvalds32ba9c32012-06-08 10:34:03 -07001625 new = __d_find_alias(inode, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001626 if (new) {
Linus Torvalds32ba9c32012-06-08 10:34:03 -07001627 BUG_ON(!(new->d_flags & DCACHE_DISCONNECTED));
Nick Piggin873feea2011-01-07 17:50:06 +11001628 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001629 security_d_instantiate(new, inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001630 d_move(new, dentry);
1631 iput(inode);
1632 } else {
Nick Piggin873feea2011-01-07 17:50:06 +11001633 /* already taking inode->i_lock, so d_add() by hand */
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001634 __d_instantiate(dentry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001635 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001636 security_d_instantiate(dentry, inode);
1637 d_rehash(dentry);
1638 }
1639 } else
1640 d_add(dentry, inode);
1641 return new;
1642}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001643EXPORT_SYMBOL(d_splice_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001644
Barry Naujok94035402008-05-21 16:50:46 +10001645/**
1646 * d_add_ci - lookup or allocate new dentry with case-exact name
1647 * @inode: the inode case-insensitive lookup has found
1648 * @dentry: the negative dentry that was passed to the parent's lookup func
1649 * @name: the case-exact name to be associated with the returned dentry
1650 *
1651 * This is to avoid filling the dcache with case-insensitive names to the
1652 * same inode, only the actual correct case is stored in the dcache for
1653 * case-insensitive filesystems.
1654 *
1655 * For a case-insensitive lookup match and if the the case-exact dentry
1656 * already exists in in the dcache, use it and return it.
1657 *
1658 * If no entry exists with the exact case name, allocate new dentry with
1659 * the exact case, and return the spliced entry.
1660 */
Christoph Hellwige45b5902008-08-07 23:49:07 +02001661struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode,
Barry Naujok94035402008-05-21 16:50:46 +10001662 struct qstr *name)
1663{
Barry Naujok94035402008-05-21 16:50:46 +10001664 struct dentry *found;
1665 struct dentry *new;
1666
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001667 /*
1668 * First check if a dentry matching the name already exists,
1669 * if not go ahead and create it now.
1670 */
Barry Naujok94035402008-05-21 16:50:46 +10001671 found = d_hash_and_lookup(dentry->d_parent, name);
Al Viro4f522a22013-02-11 23:20:37 -05001672 if (unlikely(IS_ERR(found)))
1673 goto err_out;
Barry Naujok94035402008-05-21 16:50:46 +10001674 if (!found) {
1675 new = d_alloc(dentry->d_parent, name);
1676 if (!new) {
Al Viro4f522a22013-02-11 23:20:37 -05001677 found = ERR_PTR(-ENOMEM);
Barry Naujok94035402008-05-21 16:50:46 +10001678 goto err_out;
1679 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001680
Barry Naujok94035402008-05-21 16:50:46 +10001681 found = d_splice_alias(inode, new);
1682 if (found) {
1683 dput(new);
1684 return found;
1685 }
1686 return new;
1687 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001688
1689 /*
1690 * If a matching dentry exists, and it's not negative use it.
1691 *
1692 * Decrement the reference count to balance the iget() done
1693 * earlier on.
1694 */
Barry Naujok94035402008-05-21 16:50:46 +10001695 if (found->d_inode) {
1696 if (unlikely(found->d_inode != inode)) {
1697 /* This can't happen because bad inodes are unhashed. */
1698 BUG_ON(!is_bad_inode(inode));
1699 BUG_ON(!is_bad_inode(found->d_inode));
1700 }
Barry Naujok94035402008-05-21 16:50:46 +10001701 iput(inode);
1702 return found;
1703 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001704
Barry Naujok94035402008-05-21 16:50:46 +10001705 /*
1706 * Negative dentry: instantiate it unless the inode is a directory and
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001707 * already has a dentry.
Barry Naujok94035402008-05-21 16:50:46 +10001708 */
Al Viro4513d892011-07-17 10:52:14 -04001709 new = d_splice_alias(inode, found);
1710 if (new) {
1711 dput(found);
1712 found = new;
Barry Naujok94035402008-05-21 16:50:46 +10001713 }
Al Viro4513d892011-07-17 10:52:14 -04001714 return found;
Barry Naujok94035402008-05-21 16:50:46 +10001715
1716err_out:
1717 iput(inode);
Al Viro4f522a22013-02-11 23:20:37 -05001718 return found;
Barry Naujok94035402008-05-21 16:50:46 +10001719}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001720EXPORT_SYMBOL(d_add_ci);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001721
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001722/*
1723 * Do the slow-case of the dentry name compare.
1724 *
1725 * Unlike the dentry_cmp() function, we need to atomically
1726 * load the name, length and inode information, so that the
1727 * filesystem can rely on them, and can use the 'name' and
1728 * 'len' information without worrying about walking off the
1729 * end of memory etc.
1730 *
1731 * Thus the read_seqcount_retry() and the "duplicate" info
1732 * in arguments (the low-level filesystem should not look
1733 * at the dentry inode or name contents directly, since
1734 * rename can change them while we're in RCU mode).
1735 */
1736enum slow_d_compare {
1737 D_COMP_OK,
1738 D_COMP_NOMATCH,
1739 D_COMP_SEQRETRY,
1740};
1741
1742static noinline enum slow_d_compare slow_dentry_cmp(
1743 const struct dentry *parent,
1744 struct inode *inode,
1745 struct dentry *dentry,
1746 unsigned int seq,
1747 const struct qstr *name)
1748{
1749 int tlen = dentry->d_name.len;
1750 const char *tname = dentry->d_name.name;
1751 struct inode *i = dentry->d_inode;
1752
1753 if (read_seqcount_retry(&dentry->d_seq, seq)) {
1754 cpu_relax();
1755 return D_COMP_SEQRETRY;
1756 }
1757 if (parent->d_op->d_compare(parent, inode,
1758 dentry, i,
1759 tlen, tname, name))
1760 return D_COMP_NOMATCH;
1761 return D_COMP_OK;
1762}
1763
Linus Torvalds1da177e2005-04-16 15:20:36 -07001764/**
Nick Piggin31e6b012011-01-07 17:49:52 +11001765 * __d_lookup_rcu - search for a dentry (racy, store-free)
1766 * @parent: parent dentry
1767 * @name: qstr of name we wish to find
Randy Dunlap1f1e6e52012-03-18 21:23:05 -07001768 * @seqp: returns d_seq value at the point where the dentry was found
Nick Piggin31e6b012011-01-07 17:49:52 +11001769 * @inode: returns dentry->d_inode when the inode was found valid.
1770 * Returns: dentry, or NULL
1771 *
1772 * __d_lookup_rcu is the dcache lookup function for rcu-walk name
1773 * resolution (store-free path walking) design described in
1774 * Documentation/filesystems/path-lookup.txt.
1775 *
1776 * This is not to be used outside core vfs.
1777 *
1778 * __d_lookup_rcu must only be used in rcu-walk mode, ie. with vfsmount lock
1779 * held, and rcu_read_lock held. The returned dentry must not be stored into
1780 * without taking d_lock and checking d_seq sequence count against @seq
1781 * returned here.
1782 *
1783 * A refcount may be taken on the found dentry with the __d_rcu_to_refcount
1784 * function.
1785 *
1786 * Alternatively, __d_lookup_rcu may be called again to look up the child of
1787 * the returned dentry, so long as its parent's seqlock is checked after the
1788 * child is looked up. Thus, an interlocking stepping of sequence lock checks
1789 * is formed, giving integrity down the path walk.
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001790 *
1791 * NOTE! The caller *has* to check the resulting dentry against the sequence
1792 * number we've returned before using any of the resulting dentry state!
Nick Piggin31e6b012011-01-07 17:49:52 +11001793 */
Linus Torvalds8966be92012-03-02 14:23:30 -08001794struct dentry *__d_lookup_rcu(const struct dentry *parent,
1795 const struct qstr *name,
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001796 unsigned *seqp, struct inode *inode)
Nick Piggin31e6b012011-01-07 17:49:52 +11001797{
Linus Torvalds26fe5752012-05-10 13:14:12 -07001798 u64 hashlen = name->hash_len;
Nick Piggin31e6b012011-01-07 17:49:52 +11001799 const unsigned char *str = name->name;
Linus Torvalds26fe5752012-05-10 13:14:12 -07001800 struct hlist_bl_head *b = d_hash(parent, hashlen_hash(hashlen));
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001801 struct hlist_bl_node *node;
Nick Piggin31e6b012011-01-07 17:49:52 +11001802 struct dentry *dentry;
1803
1804 /*
1805 * Note: There is significant duplication with __d_lookup_rcu which is
1806 * required to prevent single threaded performance regressions
1807 * especially on architectures where smp_rmb (in seqcounts) are costly.
1808 * Keep the two functions in sync.
1809 */
1810
1811 /*
1812 * The hash list is protected using RCU.
1813 *
1814 * Carefully use d_seq when comparing a candidate dentry, to avoid
1815 * races with d_move().
1816 *
1817 * It is possible that concurrent renames can mess up our list
1818 * walk here and result in missing our dentry, resulting in the
1819 * false-negative result. d_lookup() protects against concurrent
1820 * renames using rename_lock seqlock.
1821 *
Namhyung Kimb0a4bb82011-01-22 15:31:32 +09001822 * See Documentation/filesystems/path-lookup.txt for more details.
Nick Piggin31e6b012011-01-07 17:49:52 +11001823 */
Linus Torvaldsb07ad992011-04-23 22:32:03 -07001824 hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) {
Linus Torvalds8966be92012-03-02 14:23:30 -08001825 unsigned seq;
Nick Piggin31e6b012011-01-07 17:49:52 +11001826
Nick Piggin31e6b012011-01-07 17:49:52 +11001827seqretry:
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001828 /*
1829 * The dentry sequence count protects us from concurrent
1830 * renames, and thus protects inode, parent and name fields.
1831 *
1832 * The caller must perform a seqcount check in order
1833 * to do anything useful with the returned dentry,
1834 * including using the 'd_inode' pointer.
1835 *
1836 * NOTE! We do a "raw" seqcount_begin here. That means that
1837 * we don't wait for the sequence count to stabilize if it
1838 * is in the middle of a sequence change. If we do the slow
1839 * dentry compare, we will do seqretries until it is stable,
1840 * and if we end up with a successful lookup, we actually
1841 * want to exit RCU lookup anyway.
1842 */
1843 seq = raw_seqcount_begin(&dentry->d_seq);
Nick Piggin31e6b012011-01-07 17:49:52 +11001844 if (dentry->d_parent != parent)
1845 continue;
Linus Torvalds2e321802012-05-21 18:48:10 -07001846 if (d_unhashed(dentry))
1847 continue;
Linus Torvalds8966be92012-03-02 14:23:30 -08001848 *seqp = seq;
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001849
1850 if (unlikely(parent->d_flags & DCACHE_OP_COMPARE)) {
Linus Torvalds26fe5752012-05-10 13:14:12 -07001851 if (dentry->d_name.hash != hashlen_hash(hashlen))
1852 continue;
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001853 switch (slow_dentry_cmp(parent, inode, dentry, seq, name)) {
1854 case D_COMP_OK:
1855 return dentry;
1856 case D_COMP_NOMATCH:
1857 continue;
1858 default:
1859 goto seqretry;
1860 }
1861 }
1862
Linus Torvalds26fe5752012-05-10 13:14:12 -07001863 if (dentry->d_name.hash_len != hashlen)
Linus Torvaldsee983e82012-05-10 12:37:10 -07001864 continue;
Linus Torvalds26fe5752012-05-10 13:14:12 -07001865 if (!dentry_cmp(dentry, str, hashlen_len(hashlen)))
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001866 return dentry;
Nick Piggin31e6b012011-01-07 17:49:52 +11001867 }
1868 return NULL;
1869}
1870
1871/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07001872 * d_lookup - search for a dentry
1873 * @parent: parent dentry
1874 * @name: qstr of name we wish to find
Nick Pigginb04f7842010-08-18 04:37:34 +10001875 * Returns: dentry, or NULL
Linus Torvalds1da177e2005-04-16 15:20:36 -07001876 *
Nick Pigginb04f7842010-08-18 04:37:34 +10001877 * d_lookup searches the children of the parent dentry for the name in
1878 * question. If the dentry is found its reference count is incremented and the
1879 * dentry is returned. The caller must use dput to free the entry when it has
1880 * finished using it. %NULL is returned if the dentry does not exist.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001881 */
Al Viroda2d8452013-01-24 18:29:34 -05001882struct dentry *d_lookup(const struct dentry *parent, const struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001883{
Nick Piggin31e6b012011-01-07 17:49:52 +11001884 struct dentry *dentry;
Nick Piggin949854d2011-01-07 17:49:37 +11001885 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001886
1887 do {
1888 seq = read_seqbegin(&rename_lock);
1889 dentry = __d_lookup(parent, name);
1890 if (dentry)
1891 break;
1892 } while (read_seqretry(&rename_lock, seq));
1893 return dentry;
1894}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001895EXPORT_SYMBOL(d_lookup);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001896
Nick Piggin31e6b012011-01-07 17:49:52 +11001897/**
Nick Pigginb04f7842010-08-18 04:37:34 +10001898 * __d_lookup - search for a dentry (racy)
1899 * @parent: parent dentry
1900 * @name: qstr of name we wish to find
1901 * Returns: dentry, or NULL
1902 *
1903 * __d_lookup is like d_lookup, however it may (rarely) return a
1904 * false-negative result due to unrelated rename activity.
1905 *
1906 * __d_lookup is slightly faster by avoiding rename_lock read seqlock,
1907 * however it must be used carefully, eg. with a following d_lookup in
1908 * the case of failure.
1909 *
1910 * __d_lookup callers must be commented.
1911 */
Al Viroa713ca22013-01-24 18:27:00 -05001912struct dentry *__d_lookup(const struct dentry *parent, const struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001913{
1914 unsigned int len = name->len;
1915 unsigned int hash = name->hash;
1916 const unsigned char *str = name->name;
Linus Torvaldsb07ad992011-04-23 22:32:03 -07001917 struct hlist_bl_head *b = d_hash(parent, hash);
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001918 struct hlist_bl_node *node;
Nick Piggin31e6b012011-01-07 17:49:52 +11001919 struct dentry *found = NULL;
Paul E. McKenney665a7582005-11-07 00:59:17 -08001920 struct dentry *dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001921
Nick Pigginb04f7842010-08-18 04:37:34 +10001922 /*
Nick Piggin31e6b012011-01-07 17:49:52 +11001923 * Note: There is significant duplication with __d_lookup_rcu which is
1924 * required to prevent single threaded performance regressions
1925 * especially on architectures where smp_rmb (in seqcounts) are costly.
1926 * Keep the two functions in sync.
1927 */
1928
1929 /*
Nick Pigginb04f7842010-08-18 04:37:34 +10001930 * The hash list is protected using RCU.
1931 *
1932 * Take d_lock when comparing a candidate dentry, to avoid races
1933 * with d_move().
1934 *
1935 * It is possible that concurrent renames can mess up our list
1936 * walk here and result in missing our dentry, resulting in the
1937 * false-negative result. d_lookup() protects against concurrent
1938 * renames using rename_lock seqlock.
1939 *
Namhyung Kimb0a4bb82011-01-22 15:31:32 +09001940 * See Documentation/filesystems/path-lookup.txt for more details.
Nick Pigginb04f7842010-08-18 04:37:34 +10001941 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001942 rcu_read_lock();
1943
Linus Torvaldsb07ad992011-04-23 22:32:03 -07001944 hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001945
Linus Torvalds1da177e2005-04-16 15:20:36 -07001946 if (dentry->d_name.hash != hash)
1947 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001948
1949 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001950 if (dentry->d_parent != parent)
1951 goto next;
Linus Torvaldsd0185c02008-09-29 07:42:57 -07001952 if (d_unhashed(dentry))
1953 goto next;
1954
Linus Torvalds1da177e2005-04-16 15:20:36 -07001955 /*
1956 * It is safe to compare names since d_move() cannot
1957 * change the qstr (protected by d_lock).
1958 */
Nick Pigginfb045ad2011-01-07 17:49:55 +11001959 if (parent->d_flags & DCACHE_OP_COMPARE) {
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001960 int tlen = dentry->d_name.len;
1961 const char *tname = dentry->d_name.name;
Nick Piggin621e1552011-01-07 17:49:27 +11001962 if (parent->d_op->d_compare(parent, parent->d_inode,
1963 dentry, dentry->d_inode,
Nick Piggin31e6b012011-01-07 17:49:52 +11001964 tlen, tname, name))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001965 goto next;
1966 } else {
Linus Torvaldsee983e82012-05-10 12:37:10 -07001967 if (dentry->d_name.len != len)
1968 goto next;
Linus Torvalds12f8ad42012-05-04 14:59:14 -07001969 if (dentry_cmp(dentry, str, len))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001970 goto next;
1971 }
1972
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001973 dentry->d_count++;
Linus Torvaldsd0185c02008-09-29 07:42:57 -07001974 found = dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001975 spin_unlock(&dentry->d_lock);
1976 break;
1977next:
1978 spin_unlock(&dentry->d_lock);
1979 }
1980 rcu_read_unlock();
1981
1982 return found;
1983}
1984
1985/**
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08001986 * d_hash_and_lookup - hash the qstr then search for a dentry
1987 * @dir: Directory to search in
1988 * @name: qstr of name we wish to find
1989 *
Al Viro4f522a22013-02-11 23:20:37 -05001990 * On lookup failure NULL is returned; on bad name - ERR_PTR(-error)
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08001991 */
1992struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name)
1993{
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08001994 /*
1995 * Check for a fs-specific hash function. Note that we must
1996 * calculate the standard hash first, as the d_op->d_hash()
1997 * routine may choose to leave the hash value unchanged.
1998 */
1999 name->hash = full_name_hash(name->name, name->len);
Nick Pigginfb045ad2011-01-07 17:49:55 +11002000 if (dir->d_flags & DCACHE_OP_HASH) {
Al Viro4f522a22013-02-11 23:20:37 -05002001 int err = dir->d_op->d_hash(dir, dir->d_inode, name);
2002 if (unlikely(err < 0))
2003 return ERR_PTR(err);
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08002004 }
Al Viro4f522a22013-02-11 23:20:37 -05002005 return d_lookup(dir, name);
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08002006}
Al Viro4f522a22013-02-11 23:20:37 -05002007EXPORT_SYMBOL(d_hash_and_lookup);
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08002008
2009/**
Nick Piggin786a5e12011-01-07 17:49:16 +11002010 * d_validate - verify dentry provided from insecure source (deprecated)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002011 * @dentry: The dentry alleged to be valid child of @dparent
Randy Dunlapff5fdb62011-01-22 20:16:06 -08002012 * @dparent: The parent dentry (known to be valid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002013 *
2014 * An insecure source has sent us a dentry, here we verify it and dget() it.
2015 * This is used by ncpfs in its readdir implementation.
2016 * Zero is returned in the dentry is invalid.
Nick Piggin786a5e12011-01-07 17:49:16 +11002017 *
2018 * This function is slow for big directories, and deprecated, do not use it.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002019 */
Nick Piggind3a23e12011-01-05 20:01:21 +11002020int d_validate(struct dentry *dentry, struct dentry *dparent)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002021{
Nick Piggin786a5e12011-01-07 17:49:16 +11002022 struct dentry *child;
Nick Piggind3a23e12011-01-05 20:01:21 +11002023
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002024 spin_lock(&dparent->d_lock);
Nick Piggin786a5e12011-01-07 17:49:16 +11002025 list_for_each_entry(child, &dparent->d_subdirs, d_u.d_child) {
2026 if (dentry == child) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002027 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Nick Piggindc0474b2011-01-07 17:49:43 +11002028 __dget_dlock(dentry);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002029 spin_unlock(&dentry->d_lock);
2030 spin_unlock(&dparent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002031 return 1;
2032 }
2033 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002034 spin_unlock(&dparent->d_lock);
Nick Piggin786a5e12011-01-07 17:49:16 +11002035
Linus Torvalds1da177e2005-04-16 15:20:36 -07002036 return 0;
2037}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002038EXPORT_SYMBOL(d_validate);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002039
2040/*
2041 * When a file is deleted, we have two options:
2042 * - turn this dentry into a negative dentry
2043 * - unhash this dentry and free it.
2044 *
2045 * Usually, we want to just turn this into
2046 * a negative dentry, but if anybody else is
2047 * currently using the dentry or the inode
2048 * we can't do that and we fall back on removing
2049 * it from the hash queues and waiting for
2050 * it to be deleted later when it has no users
2051 */
2052
2053/**
2054 * d_delete - delete a dentry
2055 * @dentry: The dentry to delete
2056 *
2057 * Turn the dentry into a negative dentry if possible, otherwise
2058 * remove it from the hash queues so it can be deleted later
2059 */
2060
2061void d_delete(struct dentry * dentry)
2062{
Nick Piggin873feea2011-01-07 17:50:06 +11002063 struct inode *inode;
John McCutchan7a91bf72005-08-08 13:52:16 -04002064 int isdir = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002065 /*
2066 * Are we the only user?
2067 */
Nick Piggin357f8e62011-01-07 17:49:42 +11002068again:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002069 spin_lock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11002070 inode = dentry->d_inode;
2071 isdir = S_ISDIR(inode->i_mode);
Nick Pigginb7ab39f2011-01-07 17:49:32 +11002072 if (dentry->d_count == 1) {
Alan Cox1fe0c022012-09-19 15:49:51 +01002073 if (!spin_trylock(&inode->i_lock)) {
Nick Piggin357f8e62011-01-07 17:49:42 +11002074 spin_unlock(&dentry->d_lock);
2075 cpu_relax();
2076 goto again;
2077 }
Al Viro13e3c5e2010-05-21 16:11:04 -04002078 dentry->d_flags &= ~DCACHE_CANT_MOUNT;
Nick Piggin31e6b012011-01-07 17:49:52 +11002079 dentry_unlink_inode(dentry);
John McCutchan7a91bf72005-08-08 13:52:16 -04002080 fsnotify_nameremove(dentry, isdir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002081 return;
2082 }
2083
2084 if (!d_unhashed(dentry))
2085 __d_drop(dentry);
2086
2087 spin_unlock(&dentry->d_lock);
John McCutchan7a91bf72005-08-08 13:52:16 -04002088
2089 fsnotify_nameremove(dentry, isdir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002090}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002091EXPORT_SYMBOL(d_delete);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002092
Linus Torvaldsb07ad992011-04-23 22:32:03 -07002093static void __d_rehash(struct dentry * entry, struct hlist_bl_head *b)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002094{
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002095 BUG_ON(!d_unhashed(entry));
Christoph Hellwig1879fd62011-04-25 14:01:36 -04002096 hlist_bl_lock(b);
Linus Torvaldsdea36672011-04-24 07:58:46 -07002097 entry->d_flags |= DCACHE_RCUACCESS;
Linus Torvaldsb07ad992011-04-23 22:32:03 -07002098 hlist_bl_add_head_rcu(&entry->d_hash, b);
Christoph Hellwig1879fd62011-04-25 14:01:36 -04002099 hlist_bl_unlock(b);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002100}
2101
David Howells770bfad2006-08-22 20:06:07 -04002102static void _d_rehash(struct dentry * entry)
2103{
2104 __d_rehash(entry, d_hash(entry->d_parent, entry->d_name.hash));
2105}
2106
Linus Torvalds1da177e2005-04-16 15:20:36 -07002107/**
2108 * d_rehash - add an entry back to the hash
2109 * @entry: dentry to add to the hash
2110 *
2111 * Adds a dentry to the hash according to its name.
2112 */
2113
2114void d_rehash(struct dentry * entry)
2115{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002116 spin_lock(&entry->d_lock);
David Howells770bfad2006-08-22 20:06:07 -04002117 _d_rehash(entry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002118 spin_unlock(&entry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002119}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002120EXPORT_SYMBOL(d_rehash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002121
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002122/**
2123 * dentry_update_name_case - update case insensitive dentry with a new name
2124 * @dentry: dentry to be updated
2125 * @name: new name
2126 *
2127 * Update a case insensitive dentry with new case of name.
2128 *
2129 * dentry must have been returned by d_lookup with name @name. Old and new
2130 * name lengths must match (ie. no d_compare which allows mismatched name
2131 * lengths).
2132 *
2133 * Parent inode i_mutex must be held over d_lookup and into this call (to
2134 * keep renames and concurrent inserts, and readdir(2) away).
2135 */
2136void dentry_update_name_case(struct dentry *dentry, struct qstr *name)
2137{
Linus Torvalds7ebfa572011-04-15 07:34:26 -07002138 BUG_ON(!mutex_is_locked(&dentry->d_parent->d_inode->i_mutex));
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002139 BUG_ON(dentry->d_name.len != name->len); /* d_lookup gives this */
2140
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002141 spin_lock(&dentry->d_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +11002142 write_seqcount_begin(&dentry->d_seq);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002143 memcpy((unsigned char *)dentry->d_name.name, name->name, name->len);
Nick Piggin31e6b012011-01-07 17:49:52 +11002144 write_seqcount_end(&dentry->d_seq);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002145 spin_unlock(&dentry->d_lock);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002146}
2147EXPORT_SYMBOL(dentry_update_name_case);
2148
Linus Torvalds1da177e2005-04-16 15:20:36 -07002149static void switch_names(struct dentry *dentry, struct dentry *target)
2150{
2151 if (dname_external(target)) {
2152 if (dname_external(dentry)) {
2153 /*
2154 * Both external: swap the pointers
2155 */
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002156 swap(target->d_name.name, dentry->d_name.name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002157 } else {
2158 /*
2159 * dentry:internal, target:external. Steal target's
2160 * storage and make target internal.
2161 */
J. Bruce Fields321bcf92007-10-21 16:41:38 -07002162 memcpy(target->d_iname, dentry->d_name.name,
2163 dentry->d_name.len + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002164 dentry->d_name.name = target->d_name.name;
2165 target->d_name.name = target->d_iname;
2166 }
2167 } else {
2168 if (dname_external(dentry)) {
2169 /*
2170 * dentry:external, target:internal. Give dentry's
2171 * storage to target and make dentry internal
2172 */
2173 memcpy(dentry->d_iname, target->d_name.name,
2174 target->d_name.len + 1);
2175 target->d_name.name = dentry->d_name.name;
2176 dentry->d_name.name = dentry->d_iname;
2177 } else {
2178 /*
2179 * Both are internal. Just copy target to dentry
2180 */
2181 memcpy(dentry->d_iname, target->d_name.name,
2182 target->d_name.len + 1);
Al Virodc711ca2008-11-03 15:03:50 -05002183 dentry->d_name.len = target->d_name.len;
2184 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002185 }
2186 }
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002187 swap(dentry->d_name.len, target->d_name.len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002188}
2189
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002190static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
2191{
2192 /*
2193 * XXXX: do we really need to take target->d_lock?
2194 */
2195 if (IS_ROOT(dentry) || dentry->d_parent == target->d_parent)
2196 spin_lock(&target->d_parent->d_lock);
2197 else {
2198 if (d_ancestor(dentry->d_parent, target->d_parent)) {
2199 spin_lock(&dentry->d_parent->d_lock);
2200 spin_lock_nested(&target->d_parent->d_lock,
2201 DENTRY_D_LOCK_NESTED);
2202 } else {
2203 spin_lock(&target->d_parent->d_lock);
2204 spin_lock_nested(&dentry->d_parent->d_lock,
2205 DENTRY_D_LOCK_NESTED);
2206 }
2207 }
2208 if (target < dentry) {
2209 spin_lock_nested(&target->d_lock, 2);
2210 spin_lock_nested(&dentry->d_lock, 3);
2211 } else {
2212 spin_lock_nested(&dentry->d_lock, 2);
2213 spin_lock_nested(&target->d_lock, 3);
2214 }
2215}
2216
2217static void dentry_unlock_parents_for_move(struct dentry *dentry,
2218 struct dentry *target)
2219{
2220 if (target->d_parent != dentry->d_parent)
2221 spin_unlock(&dentry->d_parent->d_lock);
2222 if (target->d_parent != target)
2223 spin_unlock(&target->d_parent->d_lock);
2224}
2225
Linus Torvalds1da177e2005-04-16 15:20:36 -07002226/*
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002227 * When switching names, the actual string doesn't strictly have to
2228 * be preserved in the target - because we're dropping the target
2229 * anyway. As such, we can just do a simple memcpy() to copy over
2230 * the new name before we switch.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002231 *
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002232 * Note that we have to be a lot more careful about getting the hash
2233 * switched - we have to switch the hash value properly even if it
2234 * then no longer matches the actual (corrupted) string of the target.
2235 * The hash value has to match the hash queue that the dentry is on..
Linus Torvalds1da177e2005-04-16 15:20:36 -07002236 */
Trond Myklebust9eaef272006-10-21 10:24:20 -07002237/*
Al Viro18367502011-07-12 21:42:24 -04002238 * __d_move - move a dentry
Linus Torvalds1da177e2005-04-16 15:20:36 -07002239 * @dentry: entry to move
2240 * @target: new dentry
2241 *
2242 * Update the dcache to reflect the move of a file name. Negative
Jeff Laytonc46c8872011-07-26 13:33:16 -04002243 * dcache entries should not be moved in this way. Caller must hold
2244 * rename_lock, the i_mutex of the source and target directories,
2245 * and the sb->s_vfs_rename_mutex if they differ. See lock_rename().
Linus Torvalds1da177e2005-04-16 15:20:36 -07002246 */
Al Viro18367502011-07-12 21:42:24 -04002247static void __d_move(struct dentry * dentry, struct dentry * target)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002248{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002249 if (!dentry->d_inode)
2250 printk(KERN_WARNING "VFS: moving negative dcache entry\n");
2251
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002252 BUG_ON(d_ancestor(dentry, target));
2253 BUG_ON(d_ancestor(target, dentry));
2254
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002255 dentry_lock_for_move(dentry, target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002256
Nick Piggin31e6b012011-01-07 17:49:52 +11002257 write_seqcount_begin(&dentry->d_seq);
2258 write_seqcount_begin(&target->d_seq);
2259
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002260 /* __d_drop does write_seqcount_barrier, but they're OK to nest. */
2261
2262 /*
2263 * Move the dentry to the target hash queue. Don't bother checking
2264 * for the same hash queue because of how unlikely it is.
2265 */
2266 __d_drop(dentry);
Nick Piggin789680d2011-01-07 17:49:30 +11002267 __d_rehash(dentry, d_hash(target->d_parent, target->d_name.hash));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002268
2269 /* Unhash the target: dput() will then get rid of it */
2270 __d_drop(target);
2271
Eric Dumazet5160ee62006-01-08 01:03:32 -08002272 list_del(&dentry->d_u.d_child);
2273 list_del(&target->d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002274
2275 /* Switch the names.. */
2276 switch_names(dentry, target);
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002277 swap(dentry->d_name.hash, target->d_name.hash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002278
2279 /* ... and switch the parents */
2280 if (IS_ROOT(dentry)) {
2281 dentry->d_parent = target->d_parent;
2282 target->d_parent = target;
Eric Dumazet5160ee62006-01-08 01:03:32 -08002283 INIT_LIST_HEAD(&target->d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002284 } else {
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002285 swap(dentry->d_parent, target->d_parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002286
2287 /* And add them back to the (new) parent lists */
Eric Dumazet5160ee62006-01-08 01:03:32 -08002288 list_add(&target->d_u.d_child, &target->d_parent->d_subdirs);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002289 }
2290
Eric Dumazet5160ee62006-01-08 01:03:32 -08002291 list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002292
Nick Piggin31e6b012011-01-07 17:49:52 +11002293 write_seqcount_end(&target->d_seq);
2294 write_seqcount_end(&dentry->d_seq);
2295
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002296 dentry_unlock_parents_for_move(dentry, target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002297 spin_unlock(&target->d_lock);
Nick Pigginc32ccd82006-03-25 03:07:09 -08002298 fsnotify_d_move(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002299 spin_unlock(&dentry->d_lock);
Al Viro18367502011-07-12 21:42:24 -04002300}
2301
2302/*
2303 * d_move - move a dentry
2304 * @dentry: entry to move
2305 * @target: new dentry
2306 *
2307 * Update the dcache to reflect the move of a file name. Negative
Jeff Laytonc46c8872011-07-26 13:33:16 -04002308 * dcache entries should not be moved in this way. See the locking
2309 * requirements for __d_move.
Al Viro18367502011-07-12 21:42:24 -04002310 */
2311void d_move(struct dentry *dentry, struct dentry *target)
2312{
2313 write_seqlock(&rename_lock);
2314 __d_move(dentry, target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002315 write_sequnlock(&rename_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002316}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002317EXPORT_SYMBOL(d_move);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002318
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002319/**
2320 * d_ancestor - search for an ancestor
2321 * @p1: ancestor dentry
2322 * @p2: child dentry
2323 *
2324 * Returns the ancestor dentry of p2 which is a child of p1, if p1 is
2325 * an ancestor of p2, else NULL.
Trond Myklebust9eaef272006-10-21 10:24:20 -07002326 */
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002327struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2)
Trond Myklebust9eaef272006-10-21 10:24:20 -07002328{
2329 struct dentry *p;
2330
OGAWA Hirofumi871c0062008-10-16 07:50:27 +09002331 for (p = p2; !IS_ROOT(p); p = p->d_parent) {
Trond Myklebust9eaef272006-10-21 10:24:20 -07002332 if (p->d_parent == p1)
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002333 return p;
Trond Myklebust9eaef272006-10-21 10:24:20 -07002334 }
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002335 return NULL;
Trond Myklebust9eaef272006-10-21 10:24:20 -07002336}
2337
2338/*
2339 * This helper attempts to cope with remotely renamed directories
2340 *
2341 * It assumes that the caller is already holding
Al Viro18367502011-07-12 21:42:24 -04002342 * dentry->d_parent->d_inode->i_mutex, inode->i_lock and rename_lock
Trond Myklebust9eaef272006-10-21 10:24:20 -07002343 *
2344 * Note: If ever the locking in lock_rename() changes, then please
2345 * remember to update this too...
Trond Myklebust9eaef272006-10-21 10:24:20 -07002346 */
Nick Piggin873feea2011-01-07 17:50:06 +11002347static struct dentry *__d_unalias(struct inode *inode,
2348 struct dentry *dentry, struct dentry *alias)
Trond Myklebust9eaef272006-10-21 10:24:20 -07002349{
2350 struct mutex *m1 = NULL, *m2 = NULL;
Al Viroee3efa92012-06-08 15:59:33 -04002351 struct dentry *ret = ERR_PTR(-EBUSY);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002352
2353 /* If alias and dentry share a parent, then no extra locks required */
2354 if (alias->d_parent == dentry->d_parent)
2355 goto out_unalias;
2356
Trond Myklebust9eaef272006-10-21 10:24:20 -07002357 /* See lock_rename() */
Trond Myklebust9eaef272006-10-21 10:24:20 -07002358 if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex))
2359 goto out_err;
2360 m1 = &dentry->d_sb->s_vfs_rename_mutex;
2361 if (!mutex_trylock(&alias->d_parent->d_inode->i_mutex))
2362 goto out_err;
2363 m2 = &alias->d_parent->d_inode->i_mutex;
2364out_unalias:
Al Viroee3efa92012-06-08 15:59:33 -04002365 if (likely(!d_mountpoint(alias))) {
2366 __d_move(alias, dentry);
2367 ret = alias;
2368 }
Trond Myklebust9eaef272006-10-21 10:24:20 -07002369out_err:
Nick Piggin873feea2011-01-07 17:50:06 +11002370 spin_unlock(&inode->i_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002371 if (m2)
2372 mutex_unlock(m2);
2373 if (m1)
2374 mutex_unlock(m1);
2375 return ret;
2376}
2377
2378/*
David Howells770bfad2006-08-22 20:06:07 -04002379 * Prepare an anonymous dentry for life in the superblock's dentry tree as a
2380 * named dentry in place of the dentry to be replaced.
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002381 * returns with anon->d_lock held!
David Howells770bfad2006-08-22 20:06:07 -04002382 */
2383static void __d_materialise_dentry(struct dentry *dentry, struct dentry *anon)
2384{
Al Viro740da422013-01-30 10:13:38 -05002385 struct dentry *dparent;
David Howells770bfad2006-08-22 20:06:07 -04002386
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002387 dentry_lock_for_move(anon, dentry);
David Howells770bfad2006-08-22 20:06:07 -04002388
Nick Piggin31e6b012011-01-07 17:49:52 +11002389 write_seqcount_begin(&dentry->d_seq);
2390 write_seqcount_begin(&anon->d_seq);
2391
David Howells770bfad2006-08-22 20:06:07 -04002392 dparent = dentry->d_parent;
David Howells770bfad2006-08-22 20:06:07 -04002393
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002394 switch_names(dentry, anon);
2395 swap(dentry->d_name.hash, anon->d_name.hash);
2396
Al Viro740da422013-01-30 10:13:38 -05002397 dentry->d_parent = dentry;
2398 list_del_init(&dentry->d_u.d_child);
2399 anon->d_parent = dparent;
Wei Yongjun9ed53b12013-03-12 00:10:50 +08002400 list_move(&anon->d_u.d_child, &dparent->d_subdirs);
David Howells770bfad2006-08-22 20:06:07 -04002401
Nick Piggin31e6b012011-01-07 17:49:52 +11002402 write_seqcount_end(&dentry->d_seq);
2403 write_seqcount_end(&anon->d_seq);
2404
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002405 dentry_unlock_parents_for_move(anon, dentry);
2406 spin_unlock(&dentry->d_lock);
2407
2408 /* anon->d_lock still locked, returns locked */
David Howells770bfad2006-08-22 20:06:07 -04002409 anon->d_flags &= ~DCACHE_DISCONNECTED;
2410}
2411
2412/**
2413 * d_materialise_unique - introduce an inode into the tree
2414 * @dentry: candidate dentry
2415 * @inode: inode to bind to the dentry, to which aliases may be attached
2416 *
2417 * Introduces an dentry into the tree, substituting an extant disconnected
Jeff Laytonc46c8872011-07-26 13:33:16 -04002418 * root directory alias in its place if there is one. Caller must hold the
2419 * i_mutex of the parent directory.
David Howells770bfad2006-08-22 20:06:07 -04002420 */
2421struct dentry *d_materialise_unique(struct dentry *dentry, struct inode *inode)
2422{
Trond Myklebust9eaef272006-10-21 10:24:20 -07002423 struct dentry *actual;
David Howells770bfad2006-08-22 20:06:07 -04002424
2425 BUG_ON(!d_unhashed(dentry));
2426
David Howells770bfad2006-08-22 20:06:07 -04002427 if (!inode) {
2428 actual = dentry;
OGAWA Hirofumi360da902008-10-16 07:50:28 +09002429 __d_instantiate(dentry, NULL);
Nick Piggin357f8e62011-01-07 17:49:42 +11002430 d_rehash(actual);
2431 goto out_nolock;
David Howells770bfad2006-08-22 20:06:07 -04002432 }
2433
Nick Piggin873feea2011-01-07 17:50:06 +11002434 spin_lock(&inode->i_lock);
Nick Piggin357f8e62011-01-07 17:49:42 +11002435
Trond Myklebust9eaef272006-10-21 10:24:20 -07002436 if (S_ISDIR(inode->i_mode)) {
2437 struct dentry *alias;
David Howells770bfad2006-08-22 20:06:07 -04002438
Trond Myklebust9eaef272006-10-21 10:24:20 -07002439 /* Does an aliased dentry already exist? */
Linus Torvalds32ba9c32012-06-08 10:34:03 -07002440 alias = __d_find_alias(inode, 0);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002441 if (alias) {
2442 actual = alias;
Al Viro18367502011-07-12 21:42:24 -04002443 write_seqlock(&rename_lock);
2444
2445 if (d_ancestor(alias, dentry)) {
2446 /* Check for loops */
2447 actual = ERR_PTR(-ELOOP);
Michel Lespinasseb18dafc2012-03-26 17:32:44 -07002448 spin_unlock(&inode->i_lock);
Al Viro18367502011-07-12 21:42:24 -04002449 } else if (IS_ROOT(alias)) {
2450 /* Is this an anonymous mountpoint that we
2451 * could splice into our tree? */
Trond Myklebust9eaef272006-10-21 10:24:20 -07002452 __d_materialise_dentry(dentry, alias);
Al Viro18367502011-07-12 21:42:24 -04002453 write_sequnlock(&rename_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002454 __d_drop(alias);
2455 goto found;
Al Viro18367502011-07-12 21:42:24 -04002456 } else {
2457 /* Nope, but we must(!) avoid directory
Michel Lespinasseb18dafc2012-03-26 17:32:44 -07002458 * aliasing. This drops inode->i_lock */
Al Viro18367502011-07-12 21:42:24 -04002459 actual = __d_unalias(inode, dentry, alias);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002460 }
Al Viro18367502011-07-12 21:42:24 -04002461 write_sequnlock(&rename_lock);
David Howellsdd179942011-08-16 15:31:30 +01002462 if (IS_ERR(actual)) {
2463 if (PTR_ERR(actual) == -ELOOP)
2464 pr_warn_ratelimited(
2465 "VFS: Lookup of '%s' in %s %s"
2466 " would have caused loop\n",
2467 dentry->d_name.name,
2468 inode->i_sb->s_type->name,
2469 inode->i_sb->s_id);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002470 dput(alias);
David Howellsdd179942011-08-16 15:31:30 +01002471 }
Trond Myklebust9eaef272006-10-21 10:24:20 -07002472 goto out_nolock;
2473 }
David Howells770bfad2006-08-22 20:06:07 -04002474 }
2475
2476 /* Add a unique reference */
2477 actual = __d_instantiate_unique(dentry, inode);
2478 if (!actual)
2479 actual = dentry;
Nick Piggin357f8e62011-01-07 17:49:42 +11002480 else
2481 BUG_ON(!d_unhashed(actual));
David Howells770bfad2006-08-22 20:06:07 -04002482
David Howells770bfad2006-08-22 20:06:07 -04002483 spin_lock(&actual->d_lock);
2484found:
2485 _d_rehash(actual);
2486 spin_unlock(&actual->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11002487 spin_unlock(&inode->i_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002488out_nolock:
David Howells770bfad2006-08-22 20:06:07 -04002489 if (actual == dentry) {
2490 security_d_instantiate(dentry, inode);
2491 return NULL;
2492 }
2493
2494 iput(inode);
2495 return actual;
David Howells770bfad2006-08-22 20:06:07 -04002496}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002497EXPORT_SYMBOL_GPL(d_materialise_unique);
David Howells770bfad2006-08-22 20:06:07 -04002498
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002499static int prepend(char **buffer, int *buflen, const char *str, int namelen)
Ram Pai6092d042008-03-27 13:06:20 +01002500{
2501 *buflen -= namelen;
2502 if (*buflen < 0)
2503 return -ENAMETOOLONG;
2504 *buffer -= namelen;
2505 memcpy(*buffer, str, namelen);
2506 return 0;
2507}
2508
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002509static int prepend_name(char **buffer, int *buflen, struct qstr *name)
2510{
2511 return prepend(buffer, buflen, name->name, name->len);
2512}
2513
Linus Torvalds1da177e2005-04-16 15:20:36 -07002514/**
Randy Dunlap208898c2010-11-18 15:02:49 -08002515 * prepend_path - Prepend path string to a buffer
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002516 * @path: the dentry/vfsmount to report
Al Viro02125a82011-12-05 08:43:34 -05002517 * @root: root vfsmnt/dentry
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002518 * @buffer: pointer to the end of the buffer
2519 * @buflen: pointer to buffer length
2520 *
Nick Piggin949854d2011-01-07 17:49:37 +11002521 * Caller holds the rename_lock.
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002522 */
Al Viro02125a82011-12-05 08:43:34 -05002523static int prepend_path(const struct path *path,
2524 const struct path *root,
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002525 char **buffer, int *buflen)
2526{
2527 struct dentry *dentry = path->dentry;
2528 struct vfsmount *vfsmnt = path->mnt;
Al Viro0714a532011-11-24 22:19:58 -05002529 struct mount *mnt = real_mount(vfsmnt);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002530 bool slash = false;
2531 int error = 0;
2532
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002533 while (dentry != root->dentry || vfsmnt != root->mnt) {
2534 struct dentry * parent;
2535
2536 if (dentry == vfsmnt->mnt_root || IS_ROOT(dentry)) {
2537 /* Global root? */
Al Viro676da582011-11-24 21:47:05 -05002538 if (!mnt_has_parent(mnt))
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002539 goto global_root;
Al Viroa73324d2011-11-24 22:25:07 -05002540 dentry = mnt->mnt_mountpoint;
Al Viro0714a532011-11-24 22:19:58 -05002541 mnt = mnt->mnt_parent;
2542 vfsmnt = &mnt->mnt;
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002543 continue;
2544 }
2545 parent = dentry->d_parent;
2546 prefetch(parent);
Nick Piggin9abca362011-01-07 17:49:36 +11002547 spin_lock(&dentry->d_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002548 error = prepend_name(buffer, buflen, &dentry->d_name);
Nick Piggin9abca362011-01-07 17:49:36 +11002549 spin_unlock(&dentry->d_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002550 if (!error)
2551 error = prepend(buffer, buflen, "/", 1);
2552 if (error)
2553 break;
2554
2555 slash = true;
2556 dentry = parent;
2557 }
2558
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002559 if (!error && !slash)
2560 error = prepend(buffer, buflen, "/", 1);
2561
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002562 return error;
2563
2564global_root:
2565 /*
2566 * Filesystems needing to implement special "root names"
2567 * should do so with ->d_dname()
2568 */
2569 if (IS_ROOT(dentry) &&
2570 (dentry->d_name.len != 1 || dentry->d_name.name[0] != '/')) {
2571 WARN(1, "Root dentry has weird name <%.*s>\n",
2572 (int) dentry->d_name.len, dentry->d_name.name);
2573 }
Al Viro02125a82011-12-05 08:43:34 -05002574 if (!slash)
2575 error = prepend(buffer, buflen, "/", 1);
2576 if (!error)
Al Virof7a99c52012-06-09 00:59:08 -04002577 error = is_mounted(vfsmnt) ? 1 : 2;
Al Viro7ea600b2013-03-26 18:25:57 -04002578 return error;
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002579}
2580
2581/**
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +02002582 * __d_path - return the path of a dentry
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002583 * @path: the dentry/vfsmount to report
Al Viro02125a82011-12-05 08:43:34 -05002584 * @root: root vfsmnt/dentry
Randy Dunlapcd956a12010-08-14 13:05:31 -07002585 * @buf: buffer to return value in
Linus Torvalds1da177e2005-04-16 15:20:36 -07002586 * @buflen: buffer length
2587 *
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002588 * Convert a dentry into an ASCII path name.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002589 *
Arjan van de Ven52afeef2008-12-01 14:35:00 -08002590 * Returns a pointer into the buffer or an error code if the
2591 * path was too long.
Linus Torvalds552ce542007-02-13 12:08:18 -08002592 *
Christoph Hellwigbe148242010-10-10 05:36:21 -04002593 * "buflen" should be positive.
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002594 *
Al Viro02125a82011-12-05 08:43:34 -05002595 * If the path is not reachable from the supplied root, return %NULL.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002596 */
Al Viro02125a82011-12-05 08:43:34 -05002597char *__d_path(const struct path *path,
2598 const struct path *root,
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002599 char *buf, int buflen)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002600{
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002601 char *res = buf + buflen;
2602 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002603
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002604 prepend(&res, &buflen, "\0", 1);
Al Viro7ea600b2013-03-26 18:25:57 -04002605 br_read_lock(&vfsmount_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002606 write_seqlock(&rename_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002607 error = prepend_path(path, root, &res, &buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002608 write_sequnlock(&rename_lock);
Al Viro7ea600b2013-03-26 18:25:57 -04002609 br_read_unlock(&vfsmount_lock);
Christoph Hellwigbe148242010-10-10 05:36:21 -04002610
Al Viro02125a82011-12-05 08:43:34 -05002611 if (error < 0)
2612 return ERR_PTR(error);
2613 if (error > 0)
2614 return NULL;
2615 return res;
2616}
2617
2618char *d_absolute_path(const struct path *path,
2619 char *buf, int buflen)
2620{
2621 struct path root = {};
2622 char *res = buf + buflen;
2623 int error;
2624
2625 prepend(&res, &buflen, "\0", 1);
Al Viro7ea600b2013-03-26 18:25:57 -04002626 br_read_lock(&vfsmount_lock);
Al Viro02125a82011-12-05 08:43:34 -05002627 write_seqlock(&rename_lock);
2628 error = prepend_path(path, &root, &res, &buflen);
2629 write_sequnlock(&rename_lock);
Al Viro7ea600b2013-03-26 18:25:57 -04002630 br_read_unlock(&vfsmount_lock);
Al Viro02125a82011-12-05 08:43:34 -05002631
2632 if (error > 1)
2633 error = -EINVAL;
2634 if (error < 0)
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002635 return ERR_PTR(error);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002636 return res;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002637}
2638
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002639/*
2640 * same as __d_path but appends "(deleted)" for unlinked files.
2641 */
Al Viro02125a82011-12-05 08:43:34 -05002642static int path_with_deleted(const struct path *path,
2643 const struct path *root,
2644 char **buf, int *buflen)
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002645{
2646 prepend(buf, buflen, "\0", 1);
2647 if (d_unlinked(path->dentry)) {
2648 int error = prepend(buf, buflen, " (deleted)", 10);
2649 if (error)
2650 return error;
2651 }
2652
2653 return prepend_path(path, root, buf, buflen);
2654}
2655
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002656static int prepend_unreachable(char **buffer, int *buflen)
2657{
2658 return prepend(buffer, buflen, "(unreachable)", 13);
2659}
2660
Jan Bluncka03a8a702008-02-14 19:38:32 -08002661/**
2662 * d_path - return the path of a dentry
Jan Blunckcf28b482008-02-14 19:38:44 -08002663 * @path: path to report
Jan Bluncka03a8a702008-02-14 19:38:32 -08002664 * @buf: buffer to return value in
2665 * @buflen: buffer length
2666 *
2667 * Convert a dentry into an ASCII path name. If the entry has been deleted
2668 * the string " (deleted)" is appended. Note that this is ambiguous.
2669 *
Arjan van de Ven52afeef2008-12-01 14:35:00 -08002670 * Returns a pointer into the buffer or an error code if the path was
2671 * too long. Note: Callers should use the returned pointer, not the passed
2672 * in buffer, to use the name! The implementation often starts at an offset
2673 * into the buffer, and may leave 0 bytes at the start.
Jan Bluncka03a8a702008-02-14 19:38:32 -08002674 *
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +02002675 * "buflen" should be positive.
Jan Bluncka03a8a702008-02-14 19:38:32 -08002676 */
Jan Engelhardt20d4fdc2008-06-09 16:40:36 -07002677char *d_path(const struct path *path, char *buf, int buflen)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002678{
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002679 char *res = buf + buflen;
Jan Blunck6ac08c32008-02-14 19:34:38 -08002680 struct path root;
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002681 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002682
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002683 /*
2684 * We have various synthetic filesystems that never get mounted. On
2685 * these filesystems dentries are never used for lookup purposes, and
2686 * thus don't need to be hashed. They also don't need a name until a
2687 * user wants to identify the object in /proc/pid/fd/. The little hack
2688 * below allows us to generate a name for these objects on demand:
2689 */
Jan Blunckcf28b482008-02-14 19:38:44 -08002690 if (path->dentry->d_op && path->dentry->d_op->d_dname)
2691 return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002692
Miklos Szeredif7ad3c62010-08-10 11:41:36 +02002693 get_fs_root(current->fs, &root);
Al Viro7ea600b2013-03-26 18:25:57 -04002694 br_read_lock(&vfsmount_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002695 write_seqlock(&rename_lock);
Al Viro02125a82011-12-05 08:43:34 -05002696 error = path_with_deleted(path, &root, &res, &buflen);
Al Viro7ea600b2013-03-26 18:25:57 -04002697 write_sequnlock(&rename_lock);
2698 br_read_unlock(&vfsmount_lock);
Al Viro02125a82011-12-05 08:43:34 -05002699 if (error < 0)
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002700 res = ERR_PTR(error);
Jan Blunck6ac08c32008-02-14 19:34:38 -08002701 path_put(&root);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002702 return res;
2703}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002704EXPORT_SYMBOL(d_path);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002705
2706/*
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002707 * Helper function for dentry_operations.d_dname() members
2708 */
2709char *dynamic_dname(struct dentry *dentry, char *buffer, int buflen,
2710 const char *fmt, ...)
2711{
2712 va_list args;
2713 char temp[64];
2714 int sz;
2715
2716 va_start(args, fmt);
2717 sz = vsnprintf(temp, sizeof(temp), fmt, args) + 1;
2718 va_end(args);
2719
2720 if (sz > sizeof(temp) || sz > buflen)
2721 return ERR_PTR(-ENAMETOOLONG);
2722
2723 buffer += buflen - sz;
2724 return memcpy(buffer, temp, sz);
2725}
2726
2727/*
Ram Pai6092d042008-03-27 13:06:20 +01002728 * Write full pathname from the root of the filesystem into the buffer.
2729 */
Nick Pigginec2447c2011-01-07 17:49:29 +11002730static char *__dentry_path(struct dentry *dentry, char *buf, int buflen)
Ram Pai6092d042008-03-27 13:06:20 +01002731{
2732 char *end = buf + buflen;
2733 char *retval;
2734
Ram Pai6092d042008-03-27 13:06:20 +01002735 prepend(&end, &buflen, "\0", 1);
Ram Pai6092d042008-03-27 13:06:20 +01002736 if (buflen < 1)
2737 goto Elong;
2738 /* Get '/' right */
2739 retval = end-1;
2740 *retval = '/';
2741
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002742 while (!IS_ROOT(dentry)) {
2743 struct dentry *parent = dentry->d_parent;
Nick Piggin9abca362011-01-07 17:49:36 +11002744 int error;
Ram Pai6092d042008-03-27 13:06:20 +01002745
Ram Pai6092d042008-03-27 13:06:20 +01002746 prefetch(parent);
Nick Piggin9abca362011-01-07 17:49:36 +11002747 spin_lock(&dentry->d_lock);
2748 error = prepend_name(&end, &buflen, &dentry->d_name);
2749 spin_unlock(&dentry->d_lock);
2750 if (error != 0 || prepend(&end, &buflen, "/", 1) != 0)
Ram Pai6092d042008-03-27 13:06:20 +01002751 goto Elong;
2752
2753 retval = end;
2754 dentry = parent;
2755 }
Al Viroc1031352010-06-06 22:31:14 -04002756 return retval;
2757Elong:
2758 return ERR_PTR(-ENAMETOOLONG);
2759}
Nick Pigginec2447c2011-01-07 17:49:29 +11002760
2761char *dentry_path_raw(struct dentry *dentry, char *buf, int buflen)
2762{
2763 char *retval;
2764
Nick Piggin949854d2011-01-07 17:49:37 +11002765 write_seqlock(&rename_lock);
Nick Pigginec2447c2011-01-07 17:49:29 +11002766 retval = __dentry_path(dentry, buf, buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002767 write_sequnlock(&rename_lock);
Nick Pigginec2447c2011-01-07 17:49:29 +11002768
2769 return retval;
2770}
2771EXPORT_SYMBOL(dentry_path_raw);
Al Viroc1031352010-06-06 22:31:14 -04002772
2773char *dentry_path(struct dentry *dentry, char *buf, int buflen)
2774{
2775 char *p = NULL;
2776 char *retval;
2777
Nick Piggin949854d2011-01-07 17:49:37 +11002778 write_seqlock(&rename_lock);
Al Viroc1031352010-06-06 22:31:14 -04002779 if (d_unlinked(dentry)) {
2780 p = buf + buflen;
2781 if (prepend(&p, &buflen, "//deleted", 10) != 0)
2782 goto Elong;
2783 buflen++;
2784 }
2785 retval = __dentry_path(dentry, buf, buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002786 write_sequnlock(&rename_lock);
Al Viroc1031352010-06-06 22:31:14 -04002787 if (!IS_ERR(retval) && p)
2788 *p = '/'; /* restore '/' overriden with '\0' */
Ram Pai6092d042008-03-27 13:06:20 +01002789 return retval;
2790Elong:
Ram Pai6092d042008-03-27 13:06:20 +01002791 return ERR_PTR(-ENAMETOOLONG);
2792}
2793
2794/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002795 * NOTE! The user-level library version returns a
2796 * character pointer. The kernel system call just
2797 * returns the length of the buffer filled (which
2798 * includes the ending '\0' character), or a negative
2799 * error value. So libc would do something like
2800 *
2801 * char *getcwd(char * buf, size_t size)
2802 * {
2803 * int retval;
2804 *
2805 * retval = sys_getcwd(buf, size);
2806 * if (retval >= 0)
2807 * return buf;
2808 * errno = -retval;
2809 * return NULL;
2810 * }
2811 */
Heiko Carstens3cdad422009-01-14 14:14:22 +01002812SYSCALL_DEFINE2(getcwd, char __user *, buf, unsigned long, size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002813{
Linus Torvalds552ce542007-02-13 12:08:18 -08002814 int error;
Jan Blunck6ac08c32008-02-14 19:34:38 -08002815 struct path pwd, root;
Linus Torvalds552ce542007-02-13 12:08:18 -08002816 char *page = (char *) __get_free_page(GFP_USER);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002817
2818 if (!page)
2819 return -ENOMEM;
2820
Miklos Szeredif7ad3c62010-08-10 11:41:36 +02002821 get_fs_root_and_pwd(current->fs, &root, &pwd);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002822
Linus Torvalds552ce542007-02-13 12:08:18 -08002823 error = -ENOENT;
Al Viro7ea600b2013-03-26 18:25:57 -04002824 br_read_lock(&vfsmount_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002825 write_seqlock(&rename_lock);
Alexey Dobriyanf3da3922009-05-04 03:32:03 +04002826 if (!d_unlinked(pwd.dentry)) {
Linus Torvalds552ce542007-02-13 12:08:18 -08002827 unsigned long len;
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002828 char *cwd = page + PAGE_SIZE;
2829 int buflen = PAGE_SIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002830
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002831 prepend(&cwd, &buflen, "\0", 1);
Al Viro02125a82011-12-05 08:43:34 -05002832 error = prepend_path(&pwd, &root, &cwd, &buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002833 write_sequnlock(&rename_lock);
Al Viro7ea600b2013-03-26 18:25:57 -04002834 br_read_unlock(&vfsmount_lock);
Linus Torvalds552ce542007-02-13 12:08:18 -08002835
Al Viro02125a82011-12-05 08:43:34 -05002836 if (error < 0)
Linus Torvalds552ce542007-02-13 12:08:18 -08002837 goto out;
2838
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002839 /* Unreachable from current root */
Al Viro02125a82011-12-05 08:43:34 -05002840 if (error > 0) {
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002841 error = prepend_unreachable(&cwd, &buflen);
2842 if (error)
2843 goto out;
2844 }
2845
Linus Torvalds552ce542007-02-13 12:08:18 -08002846 error = -ERANGE;
2847 len = PAGE_SIZE + page - cwd;
2848 if (len <= size) {
2849 error = len;
2850 if (copy_to_user(buf, cwd, len))
2851 error = -EFAULT;
2852 }
Nick Piggin949854d2011-01-07 17:49:37 +11002853 } else {
2854 write_sequnlock(&rename_lock);
Al Viro7ea600b2013-03-26 18:25:57 -04002855 br_read_unlock(&vfsmount_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002856 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002857
2858out:
Jan Blunck6ac08c32008-02-14 19:34:38 -08002859 path_put(&pwd);
2860 path_put(&root);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002861 free_page((unsigned long) page);
2862 return error;
2863}
2864
2865/*
2866 * Test whether new_dentry is a subdirectory of old_dentry.
2867 *
2868 * Trivially implemented using the dcache structure
2869 */
2870
2871/**
2872 * is_subdir - is new dentry a subdirectory of old_dentry
2873 * @new_dentry: new dentry
2874 * @old_dentry: old dentry
2875 *
2876 * Returns 1 if new_dentry is a subdirectory of the parent (at any depth).
2877 * Returns 0 otherwise.
2878 * Caller must ensure that "new_dentry" is pinned before calling is_subdir()
2879 */
2880
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002881int is_subdir(struct dentry *new_dentry, struct dentry *old_dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002882{
2883 int result;
Nick Piggin949854d2011-01-07 17:49:37 +11002884 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002885
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002886 if (new_dentry == old_dentry)
2887 return 1;
2888
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002889 do {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002890 /* for restarting inner loop in case of seq retry */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002891 seq = read_seqbegin(&rename_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002892 /*
2893 * Need rcu_readlock to protect against the d_parent trashing
2894 * due to d_move
2895 */
2896 rcu_read_lock();
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002897 if (d_ancestor(old_dentry, new_dentry))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002898 result = 1;
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002899 else
2900 result = 0;
Nick Piggin949854d2011-01-07 17:49:37 +11002901 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002902 } while (read_seqretry(&rename_lock, seq));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002903
2904 return result;
2905}
2906
2907void d_genocide(struct dentry *root)
2908{
Nick Piggin949854d2011-01-07 17:49:37 +11002909 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002910 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11002911 unsigned seq;
Nick Piggin58db63d2011-01-07 17:49:39 +11002912 int locked = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002913
Nick Piggin949854d2011-01-07 17:49:37 +11002914 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11002915again:
2916 this_parent = root;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002917 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002918repeat:
2919 next = this_parent->d_subdirs.next;
2920resume:
2921 while (next != &this_parent->d_subdirs) {
2922 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08002923 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002924 next = tmp->next;
Nick Piggin949854d2011-01-07 17:49:37 +11002925
Nick Pigginda502952011-01-07 17:49:33 +11002926 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
2927 if (d_unhashed(dentry) || !dentry->d_inode) {
2928 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002929 continue;
Nick Pigginda502952011-01-07 17:49:33 +11002930 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002931 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002932 spin_unlock(&this_parent->d_lock);
2933 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002934 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002935 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002936 goto repeat;
2937 }
Nick Piggin949854d2011-01-07 17:49:37 +11002938 if (!(dentry->d_flags & DCACHE_GENOCIDE)) {
2939 dentry->d_flags |= DCACHE_GENOCIDE;
2940 dentry->d_count--;
2941 }
Nick Pigginb7ab39f2011-01-07 17:49:32 +11002942 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002943 }
2944 if (this_parent != root) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07002945 struct dentry *child = this_parent;
Nick Piggin949854d2011-01-07 17:49:37 +11002946 if (!(this_parent->d_flags & DCACHE_GENOCIDE)) {
2947 this_parent->d_flags |= DCACHE_GENOCIDE;
2948 this_parent->d_count--;
2949 }
Linus Torvaldsc826cb72011-03-15 15:29:21 -07002950 this_parent = try_to_ascend(this_parent, locked, seq);
2951 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11002952 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11002953 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002954 goto resume;
2955 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002956 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11002957 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11002958 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11002959 if (locked)
2960 write_sequnlock(&rename_lock);
2961 return;
2962
2963rename_retry:
Miklos Szeredi8110e162012-09-17 22:23:30 +02002964 if (locked)
2965 goto again;
Nick Piggin58db63d2011-01-07 17:49:39 +11002966 locked = 1;
2967 write_seqlock(&rename_lock);
2968 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002969}
2970
2971/**
2972 * find_inode_number - check for dentry with name
2973 * @dir: directory to check
2974 * @name: Name to find.
2975 *
2976 * Check whether a dentry already exists for the given name,
2977 * and return the inode number if it has an inode. Otherwise
2978 * 0 is returned.
2979 *
2980 * This routine is used to post-process directory listings for
2981 * filesystems using synthetic inode numbers, and is necessary
2982 * to keep getcwd() working.
2983 */
2984
2985ino_t find_inode_number(struct dentry *dir, struct qstr *name)
2986{
2987 struct dentry * dentry;
2988 ino_t ino = 0;
2989
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08002990 dentry = d_hash_and_lookup(dir, name);
Al Viro4f522a22013-02-11 23:20:37 -05002991 if (!IS_ERR_OR_NULL(dentry)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002992 if (dentry->d_inode)
2993 ino = dentry->d_inode->i_ino;
2994 dput(dentry);
2995 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002996 return ino;
2997}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002998EXPORT_SYMBOL(find_inode_number);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002999
3000static __initdata unsigned long dhash_entries;
3001static int __init set_dhash_entries(char *str)
3002{
3003 if (!str)
3004 return 0;
3005 dhash_entries = simple_strtoul(str, &str, 0);
3006 return 1;
3007}
3008__setup("dhash_entries=", set_dhash_entries);
3009
3010static void __init dcache_init_early(void)
3011{
Dimitri Sivanich074b8512012-02-08 12:39:07 -08003012 unsigned int loop;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003013
3014 /* If hashes are distributed across NUMA nodes, defer
3015 * hash allocation until vmalloc space is available.
3016 */
3017 if (hashdist)
3018 return;
3019
3020 dentry_hashtable =
3021 alloc_large_system_hash("Dentry cache",
Linus Torvaldsb07ad992011-04-23 22:32:03 -07003022 sizeof(struct hlist_bl_head),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003023 dhash_entries,
3024 13,
3025 HASH_EARLY,
3026 &d_hash_shift,
3027 &d_hash_mask,
Tim Bird31fe62b2012-05-23 13:33:35 +00003028 0,
Linus Torvalds1da177e2005-04-16 15:20:36 -07003029 0);
3030
Dimitri Sivanich074b8512012-02-08 12:39:07 -08003031 for (loop = 0; loop < (1U << d_hash_shift); loop++)
Linus Torvaldsb07ad992011-04-23 22:32:03 -07003032 INIT_HLIST_BL_HEAD(dentry_hashtable + loop);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003033}
3034
Denis Cheng74bf17c2007-10-16 23:26:30 -07003035static void __init dcache_init(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003036{
Dimitri Sivanich074b8512012-02-08 12:39:07 -08003037 unsigned int loop;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003038
3039 /*
3040 * A constructor could be added for stable state like the lists,
3041 * but it is probably not worth it because of the cache nature
3042 * of the dcache.
3043 */
Christoph Lameter0a31bd52007-05-06 14:49:57 -07003044 dentry_cache = KMEM_CACHE(dentry,
3045 SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003046
3047 /* Hash may have been set up in dcache_init_early */
3048 if (!hashdist)
3049 return;
3050
3051 dentry_hashtable =
3052 alloc_large_system_hash("Dentry cache",
Linus Torvaldsb07ad992011-04-23 22:32:03 -07003053 sizeof(struct hlist_bl_head),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003054 dhash_entries,
3055 13,
3056 0,
3057 &d_hash_shift,
3058 &d_hash_mask,
Tim Bird31fe62b2012-05-23 13:33:35 +00003059 0,
Linus Torvalds1da177e2005-04-16 15:20:36 -07003060 0);
3061
Dimitri Sivanich074b8512012-02-08 12:39:07 -08003062 for (loop = 0; loop < (1U << d_hash_shift); loop++)
Linus Torvaldsb07ad992011-04-23 22:32:03 -07003063 INIT_HLIST_BL_HEAD(dentry_hashtable + loop);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003064}
3065
3066/* SLAB cache for __getname() consumers */
Christoph Lametere18b8902006-12-06 20:33:20 -08003067struct kmem_cache *names_cachep __read_mostly;
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07003068EXPORT_SYMBOL(names_cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003069
Linus Torvalds1da177e2005-04-16 15:20:36 -07003070EXPORT_SYMBOL(d_genocide);
3071
Linus Torvalds1da177e2005-04-16 15:20:36 -07003072void __init vfs_caches_init_early(void)
3073{
3074 dcache_init_early();
3075 inode_init_early();
3076}
3077
3078void __init vfs_caches_init(unsigned long mempages)
3079{
3080 unsigned long reserve;
3081
3082 /* Base hash sizes on available memory, with a reserve equal to
3083 150% of current kernel size */
3084
3085 reserve = min((mempages - nr_free_pages()) * 3/2, mempages - 1);
3086 mempages -= reserve;
3087
3088 names_cachep = kmem_cache_create("names_cache", PATH_MAX, 0,
Paul Mundt20c2df82007-07-20 10:11:58 +09003089 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003090
Denis Cheng74bf17c2007-10-16 23:26:30 -07003091 dcache_init();
3092 inode_init();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003093 files_init(mempages);
Denis Cheng74bf17c2007-10-16 23:26:30 -07003094 mnt_init();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003095 bdev_cache_init();
3096 chrdev_init();
3097}