blob: a39fe47c466f794cb4f794ccd2863f2e165fc03e [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>
26#include <linux/module.h>
27#include <linux/mount.h>
28#include <linux/file.h>
29#include <asm/uaccess.h>
30#include <linux/security.h>
31#include <linux/seqlock.h>
32#include <linux/swap.h>
33#include <linux/bootmem.h>
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>
David Howells07f3f052006-09-30 20:52:18 +020038#include "internal.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070039
Nick Piggin789680d2011-01-07 17:49:30 +110040/*
41 * Usage:
Nick Piggin873feea2011-01-07 17:50:06 +110042 * dcache->d_inode->i_lock protects:
43 * - i_dentry, d_alias, d_inode of aliases
Nick Pigginceb5bdc2011-01-07 17:50:05 +110044 * dcache_hash_bucket lock protects:
45 * - the dcache hash table
46 * s_anon bl list spinlock protects:
47 * - the s_anon list (see __d_drop)
Nick Piggin23044502011-01-07 17:49:31 +110048 * dcache_lru_lock protects:
49 * - the dcache lru lists and counters
50 * d_lock protects:
51 * - d_flags
52 * - d_name
53 * - d_lru
Nick Pigginb7ab39f2011-01-07 17:49:32 +110054 * - d_count
Nick Pigginda502952011-01-07 17:49:33 +110055 * - d_unhashed()
Nick Piggin2fd6b7f2011-01-07 17:49:34 +110056 * - d_parent and d_subdirs
57 * - childrens' d_child and d_parent
Nick Pigginb23fb0a2011-01-07 17:49:35 +110058 * - d_alias, d_inode
Nick Piggin789680d2011-01-07 17:49:30 +110059 *
60 * Ordering:
Nick Piggin873feea2011-01-07 17:50:06 +110061 * dentry->d_inode->i_lock
Nick Pigginb5c84bf2011-01-07 17:49:38 +110062 * dentry->d_lock
63 * dcache_lru_lock
Nick Pigginceb5bdc2011-01-07 17:50:05 +110064 * dcache_hash_bucket lock
65 * s_anon lock
Nick Piggin789680d2011-01-07 17:49:30 +110066 *
Nick Pigginda502952011-01-07 17:49:33 +110067 * If there is an ancestor relationship:
68 * dentry->d_parent->...->d_parent->d_lock
69 * ...
70 * dentry->d_parent->d_lock
71 * dentry->d_lock
72 *
73 * If no ancestor relationship:
Nick Piggin789680d2011-01-07 17:49:30 +110074 * if (dentry1 < dentry2)
75 * dentry1->d_lock
76 * dentry2->d_lock
77 */
Eric Dumazetfa3536c2006-03-26 01:37:24 -080078int sysctl_vfs_cache_pressure __read_mostly = 100;
Linus Torvalds1da177e2005-04-16 15:20:36 -070079EXPORT_SYMBOL_GPL(sysctl_vfs_cache_pressure);
80
Nick Piggin23044502011-01-07 17:49:31 +110081static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_lru_lock);
Al Viro74c3cbe2007-07-22 08:04:18 -040082__cacheline_aligned_in_smp DEFINE_SEQLOCK(rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070083
Nick Piggin949854d2011-01-07 17:49:37 +110084EXPORT_SYMBOL(rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070085
Christoph Lametere18b8902006-12-06 20:33:20 -080086static struct kmem_cache *dentry_cache __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070087
Linus Torvalds1da177e2005-04-16 15:20:36 -070088/*
89 * This is the single most critical data structure when it comes
90 * to the dcache: the hashtable for lookups. Somebody should try
91 * to make this good - I've just made it work.
92 *
93 * This hash-function tries to avoid losing too many bits of hash
94 * information, yet avoid using a prime hash-size or similar.
95 */
96#define D_HASHBITS d_hash_shift
97#define D_HASHMASK d_hash_mask
98
Eric Dumazetfa3536c2006-03-26 01:37:24 -080099static unsigned int d_hash_mask __read_mostly;
100static unsigned int d_hash_shift __read_mostly;
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100101
102struct dcache_hash_bucket {
103 struct hlist_bl_head head;
104};
105static struct dcache_hash_bucket *dentry_hashtable __read_mostly;
106
107static inline struct dcache_hash_bucket *d_hash(struct dentry *parent,
108 unsigned long hash)
109{
110 hash += ((unsigned long) parent ^ GOLDEN_RATIO_PRIME) / L1_CACHE_BYTES;
111 hash = hash ^ ((hash ^ GOLDEN_RATIO_PRIME) >> D_HASHBITS);
112 return dentry_hashtable + (hash & D_HASHMASK);
113}
114
115static inline void spin_lock_bucket(struct dcache_hash_bucket *b)
116{
117 bit_spin_lock(0, (unsigned long *)&b->head.first);
118}
119
120static inline void spin_unlock_bucket(struct dcache_hash_bucket *b)
121{
122 __bit_spin_unlock(0, (unsigned long *)&b->head.first);
123}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124
125/* Statistics gathering. */
126struct dentry_stat_t dentry_stat = {
127 .age_limit = 45,
128};
129
Nick Piggin3e880fb2011-01-07 17:49:19 +1100130static DEFINE_PER_CPU(unsigned int, nr_dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400131
132#if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
Nick Piggin3e880fb2011-01-07 17:49:19 +1100133static int get_nr_dentry(void)
134{
135 int i;
136 int sum = 0;
137 for_each_possible_cpu(i)
138 sum += per_cpu(nr_dentry, i);
139 return sum < 0 ? 0 : sum;
140}
141
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400142int proc_nr_dentry(ctl_table *table, int write, void __user *buffer,
143 size_t *lenp, loff_t *ppos)
144{
Nick Piggin3e880fb2011-01-07 17:49:19 +1100145 dentry_stat.nr_dentry = get_nr_dentry();
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400146 return proc_dointvec(table, write, buffer, lenp, ppos);
147}
148#endif
149
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400150static void __d_free(struct rcu_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151{
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400152 struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu);
153
Arjan van de Venfd217f42008-10-21 06:47:33 -0700154 WARN_ON(!list_empty(&dentry->d_alias));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 if (dname_external(dentry))
156 kfree(dentry->d_name.name);
157 kmem_cache_free(dentry_cache, dentry);
158}
159
160/*
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100161 * no locks, please.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 */
163static void d_free(struct dentry *dentry)
164{
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100165 BUG_ON(dentry->d_count);
Nick Piggin3e880fb2011-01-07 17:49:19 +1100166 this_cpu_dec(nr_dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 if (dentry->d_op && dentry->d_op->d_release)
168 dentry->d_op->d_release(dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400169
Eric Dumazetb3423412006-12-06 20:38:48 -0800170 /* if dentry was never inserted into hash, immediate free is OK */
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100171 if (hlist_bl_unhashed(&dentry->d_hash))
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400172 __d_free(&dentry->d_u.d_rcu);
Eric Dumazetb3423412006-12-06 20:38:48 -0800173 else
Christoph Hellwig9c82ab92010-10-10 05:36:22 -0400174 call_rcu(&dentry->d_u.d_rcu, __d_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175}
176
Nick Piggin31e6b012011-01-07 17:49:52 +1100177/**
178 * dentry_rcuwalk_barrier - invalidate in-progress rcu-walk lookups
Randy Dunlapff5fdb62011-01-22 20:16:06 -0800179 * @dentry: the target dentry
Nick Piggin31e6b012011-01-07 17:49:52 +1100180 * After this call, in-progress rcu-walk path lookup will fail. This
181 * should be called after unhashing, and after changing d_inode (if
182 * the dentry has not already been unhashed).
183 */
184static inline void dentry_rcuwalk_barrier(struct dentry *dentry)
185{
186 assert_spin_locked(&dentry->d_lock);
187 /* Go through a barrier */
188 write_seqcount_barrier(&dentry->d_seq);
189}
190
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191/*
192 * Release the dentry's inode, using the filesystem
Nick Piggin31e6b012011-01-07 17:49:52 +1100193 * d_iput() operation if defined. Dentry has no refcount
194 * and is unhashed.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 */
Arjan van de Ven858119e2006-01-14 13:20:43 -0800196static void dentry_iput(struct dentry * dentry)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200197 __releases(dentry->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100198 __releases(dentry->d_inode->i_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199{
200 struct inode *inode = dentry->d_inode;
201 if (inode) {
202 dentry->d_inode = NULL;
203 list_del_init(&dentry->d_alias);
204 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100205 spin_unlock(&inode->i_lock);
Linus Torvaldsf805fbd2005-09-19 19:54:29 -0700206 if (!inode->i_nlink)
207 fsnotify_inoderemove(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208 if (dentry->d_op && dentry->d_op->d_iput)
209 dentry->d_op->d_iput(dentry, inode);
210 else
211 iput(inode);
212 } else {
213 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 }
215}
216
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700217/*
Nick Piggin31e6b012011-01-07 17:49:52 +1100218 * Release the dentry's inode, using the filesystem
219 * d_iput() operation if defined. dentry remains in-use.
220 */
221static void dentry_unlink_inode(struct dentry * dentry)
222 __releases(dentry->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100223 __releases(dentry->d_inode->i_lock)
Nick Piggin31e6b012011-01-07 17:49:52 +1100224{
225 struct inode *inode = dentry->d_inode;
226 dentry->d_inode = NULL;
227 list_del_init(&dentry->d_alias);
228 dentry_rcuwalk_barrier(dentry);
229 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100230 spin_unlock(&inode->i_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +1100231 if (!inode->i_nlink)
232 fsnotify_inoderemove(inode);
233 if (dentry->d_op && dentry->d_op->d_iput)
234 dentry->d_op->d_iput(dentry, inode);
235 else
236 iput(inode);
237}
238
239/*
Nick Piggin23044502011-01-07 17:49:31 +1100240 * dentry_lru_(add|del|move_tail) must be called with d_lock held.
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700241 */
242static void dentry_lru_add(struct dentry *dentry)
243{
Christoph Hellwiga4633352010-10-10 05:36:26 -0400244 if (list_empty(&dentry->d_lru)) {
Nick Piggin23044502011-01-07 17:49:31 +1100245 spin_lock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400246 list_add(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
247 dentry->d_sb->s_nr_dentry_unused++;
Nick Piggin86c87492011-01-07 17:49:18 +1100248 dentry_stat.nr_unused++;
Nick Piggin23044502011-01-07 17:49:31 +1100249 spin_unlock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400250 }
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700251}
252
Nick Piggin23044502011-01-07 17:49:31 +1100253static void __dentry_lru_del(struct dentry *dentry)
254{
255 list_del_init(&dentry->d_lru);
256 dentry->d_sb->s_nr_dentry_unused--;
257 dentry_stat.nr_unused--;
258}
259
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700260static void dentry_lru_del(struct dentry *dentry)
261{
262 if (!list_empty(&dentry->d_lru)) {
Nick Piggin23044502011-01-07 17:49:31 +1100263 spin_lock(&dcache_lru_lock);
264 __dentry_lru_del(dentry);
265 spin_unlock(&dcache_lru_lock);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700266 }
267}
268
Christoph Hellwiga4633352010-10-10 05:36:26 -0400269static void dentry_lru_move_tail(struct dentry *dentry)
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700270{
Nick Piggin23044502011-01-07 17:49:31 +1100271 spin_lock(&dcache_lru_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400272 if (list_empty(&dentry->d_lru)) {
273 list_add_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
274 dentry->d_sb->s_nr_dentry_unused++;
Nick Piggin86c87492011-01-07 17:49:18 +1100275 dentry_stat.nr_unused++;
Christoph Hellwiga4633352010-10-10 05:36:26 -0400276 } else {
277 list_move_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700278 }
Nick Piggin23044502011-01-07 17:49:31 +1100279 spin_unlock(&dcache_lru_lock);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700280}
281
Miklos Szeredid52b9082007-05-08 00:23:46 -0700282/**
283 * d_kill - kill dentry and return parent
284 * @dentry: dentry to kill
Randy Dunlapff5fdb62011-01-22 20:16:06 -0800285 * @parent: parent dentry
Miklos Szeredid52b9082007-05-08 00:23:46 -0700286 *
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200287 * The dentry must already be unhashed and removed from the LRU.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700288 *
289 * If this is the root of the dentry tree, return NULL.
Nick Piggin23044502011-01-07 17:49:31 +1100290 *
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100291 * dentry->d_lock and parent->d_lock must be held by caller, and are dropped by
292 * d_kill.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700293 */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100294static struct dentry *d_kill(struct dentry *dentry, struct dentry *parent)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200295 __releases(dentry->d_lock)
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100296 __releases(parent->d_lock)
Nick Piggin873feea2011-01-07 17:50:06 +1100297 __releases(dentry->d_inode->i_lock)
Miklos Szeredid52b9082007-05-08 00:23:46 -0700298{
Miklos Szeredid52b9082007-05-08 00:23:46 -0700299 list_del(&dentry->d_u.d_child);
Trond Myklebustc83ce982011-03-15 13:36:43 -0400300 /*
301 * Inform try_to_ascend() that we are no longer attached to the
302 * dentry tree
303 */
304 dentry->d_flags |= DCACHE_DISCONNECTED;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100305 if (parent)
306 spin_unlock(&parent->d_lock);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700307 dentry_iput(dentry);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100308 /*
309 * dentry_iput drops the locks, at which point nobody (except
310 * transient RCU lookups) can reach this dentry.
311 */
Miklos Szeredid52b9082007-05-08 00:23:46 -0700312 d_free(dentry);
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900313 return parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700314}
315
Nick Piggin789680d2011-01-07 17:49:30 +1100316/**
317 * d_drop - drop a dentry
318 * @dentry: dentry to drop
319 *
320 * d_drop() unhashes the entry from the parent dentry hashes, so that it won't
321 * be found through a VFS lookup any more. Note that this is different from
322 * deleting the dentry - d_delete will try to mark the dentry negative if
323 * possible, giving a successful _negative_ lookup, while d_drop will
324 * just make the cache lookup fail.
325 *
326 * d_drop() is used mainly for stuff that wants to invalidate a dentry for some
327 * reason (NFS timeouts or autofs deletes).
328 *
329 * __d_drop requires dentry->d_lock.
330 */
331void __d_drop(struct dentry *dentry)
332{
333 if (!(dentry->d_flags & DCACHE_UNHASHED)) {
Nick Pigginceb5bdc2011-01-07 17:50:05 +1100334 if (unlikely(dentry->d_flags & DCACHE_DISCONNECTED)) {
335 bit_spin_lock(0,
336 (unsigned long *)&dentry->d_sb->s_anon.first);
337 dentry->d_flags |= DCACHE_UNHASHED;
338 hlist_bl_del_init(&dentry->d_hash);
339 __bit_spin_unlock(0,
340 (unsigned long *)&dentry->d_sb->s_anon.first);
341 } else {
342 struct dcache_hash_bucket *b;
343 b = d_hash(dentry->d_parent, dentry->d_name.hash);
344 spin_lock_bucket(b);
345 /*
346 * We may not actually need to put DCACHE_UNHASHED
347 * manipulations under the hash lock, but follow
348 * the principle of least surprise.
349 */
350 dentry->d_flags |= DCACHE_UNHASHED;
351 hlist_bl_del_rcu(&dentry->d_hash);
352 spin_unlock_bucket(b);
353 dentry_rcuwalk_barrier(dentry);
354 }
Nick Piggin789680d2011-01-07 17:49:30 +1100355 }
356}
357EXPORT_SYMBOL(__d_drop);
358
359void d_drop(struct dentry *dentry)
360{
Nick Piggin789680d2011-01-07 17:49:30 +1100361 spin_lock(&dentry->d_lock);
362 __d_drop(dentry);
363 spin_unlock(&dentry->d_lock);
Nick Piggin789680d2011-01-07 17:49:30 +1100364}
365EXPORT_SYMBOL(d_drop);
366
Nick Piggin77812a12011-01-07 17:49:48 +1100367/*
368 * Finish off a dentry we've decided to kill.
369 * dentry->d_lock must be held, returns with it unlocked.
370 * If ref is non-zero, then decrement the refcount too.
371 * Returns dentry requiring refcount drop, or NULL if we're done.
372 */
373static inline struct dentry *dentry_kill(struct dentry *dentry, int ref)
374 __releases(dentry->d_lock)
375{
Nick Piggin873feea2011-01-07 17:50:06 +1100376 struct inode *inode;
Nick Piggin77812a12011-01-07 17:49:48 +1100377 struct dentry *parent;
378
Nick Piggin873feea2011-01-07 17:50:06 +1100379 inode = dentry->d_inode;
380 if (inode && !spin_trylock(&inode->i_lock)) {
Nick Piggin77812a12011-01-07 17:49:48 +1100381relock:
382 spin_unlock(&dentry->d_lock);
383 cpu_relax();
384 return dentry; /* try again with same dentry */
385 }
386 if (IS_ROOT(dentry))
387 parent = NULL;
388 else
389 parent = dentry->d_parent;
390 if (parent && !spin_trylock(&parent->d_lock)) {
Nick Piggin873feea2011-01-07 17:50:06 +1100391 if (inode)
392 spin_unlock(&inode->i_lock);
Nick Piggin77812a12011-01-07 17:49:48 +1100393 goto relock;
394 }
Nick Piggin31e6b012011-01-07 17:49:52 +1100395
Nick Piggin77812a12011-01-07 17:49:48 +1100396 if (ref)
397 dentry->d_count--;
398 /* if dentry was on the d_lru list delete it from there */
399 dentry_lru_del(dentry);
400 /* if it was on the hash then remove it */
401 __d_drop(dentry);
402 return d_kill(dentry, parent);
403}
404
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405/*
406 * This is dput
407 *
408 * This is complicated by the fact that we do not want to put
409 * dentries that are no longer on any hash chain on the unused
410 * list: we'd much rather just get rid of them immediately.
411 *
412 * However, that implies that we have to traverse the dentry
413 * tree upwards to the parents which might _also_ now be
414 * scheduled for deletion (it may have been only waiting for
415 * its last child to go away).
416 *
417 * This tail recursion is done by hand as we don't want to depend
418 * on the compiler to always get this right (gcc generally doesn't).
419 * Real recursion would eat up our stack space.
420 */
421
422/*
423 * dput - release a dentry
424 * @dentry: dentry to release
425 *
426 * Release a dentry. This will drop the usage count and if appropriate
427 * call the dentry unlink method as well as removing it from the queues and
428 * releasing its resources. If the parent dentries were scheduled for release
429 * they too may now get deleted.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431void dput(struct dentry *dentry)
432{
433 if (!dentry)
434 return;
435
436repeat:
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100437 if (dentry->d_count == 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439 spin_lock(&dentry->d_lock);
Nick Piggin61f3dee2011-01-07 17:49:40 +1100440 BUG_ON(!dentry->d_count);
441 if (dentry->d_count > 1) {
442 dentry->d_count--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444 return;
445 }
446
Nick Pigginfb045ad2011-01-07 17:49:55 +1100447 if (dentry->d_flags & DCACHE_OP_DELETE) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448 if (dentry->d_op->d_delete(dentry))
Nick Piggin61f3dee2011-01-07 17:49:40 +1100449 goto kill_it;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450 }
Nick Piggin265ac902010-10-10 05:36:24 -0400451
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 /* Unreachable? Get rid of it */
453 if (d_unhashed(dentry))
454 goto kill_it;
Nick Piggin265ac902010-10-10 05:36:24 -0400455
456 /* Otherwise leave it cached and ensure it's on the LRU */
457 dentry->d_flags |= DCACHE_REFERENCED;
Christoph Hellwiga4633352010-10-10 05:36:26 -0400458 dentry_lru_add(dentry);
Nick Piggin265ac902010-10-10 05:36:24 -0400459
Nick Piggin61f3dee2011-01-07 17:49:40 +1100460 dentry->d_count--;
461 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 return;
463
Miklos Szeredid52b9082007-05-08 00:23:46 -0700464kill_it:
Nick Piggin77812a12011-01-07 17:49:48 +1100465 dentry = dentry_kill(dentry, 1);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700466 if (dentry)
467 goto repeat;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700469EXPORT_SYMBOL(dput);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470
471/**
472 * d_invalidate - invalidate a dentry
473 * @dentry: dentry to invalidate
474 *
475 * Try to invalidate the dentry if it turns out to be
476 * possible. If there are other dentries that can be
477 * reached through this one we can't delete it and we
478 * return -EBUSY. On success we return 0.
479 *
480 * no dcache lock.
481 */
482
483int d_invalidate(struct dentry * dentry)
484{
485 /*
486 * If it's already been dropped, return OK.
487 */
Nick Pigginda502952011-01-07 17:49:33 +1100488 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 if (d_unhashed(dentry)) {
Nick Pigginda502952011-01-07 17:49:33 +1100490 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491 return 0;
492 }
493 /*
494 * Check whether to do a partial shrink_dcache
495 * to get rid of unused child entries.
496 */
497 if (!list_empty(&dentry->d_subdirs)) {
Nick Pigginda502952011-01-07 17:49:33 +1100498 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 shrink_dcache_parent(dentry);
Nick Pigginda502952011-01-07 17:49:33 +1100500 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 }
502
503 /*
504 * Somebody else still using it?
505 *
506 * If it's a directory, we can't drop it
507 * for fear of somebody re-populating it
508 * with children (even though dropping it
509 * would make it unreachable from the root,
510 * we might still populate it if it was a
511 * working directory or similar).
512 */
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100513 if (dentry->d_count > 1) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514 if (dentry->d_inode && S_ISDIR(dentry->d_inode->i_mode)) {
515 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516 return -EBUSY;
517 }
518 }
519
520 __d_drop(dentry);
521 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522 return 0;
523}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700524EXPORT_SYMBOL(d_invalidate);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100526/* This must be called with d_lock held */
Nick Piggindc0474b2011-01-07 17:49:43 +1100527static inline void __dget_dlock(struct dentry *dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528{
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100529 dentry->d_count++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530}
531
Nick Piggindc0474b2011-01-07 17:49:43 +1100532static inline void __dget(struct dentry *dentry)
Nick Piggin23044502011-01-07 17:49:31 +1100533{
Nick Piggin23044502011-01-07 17:49:31 +1100534 spin_lock(&dentry->d_lock);
Nick Piggindc0474b2011-01-07 17:49:43 +1100535 __dget_dlock(dentry);
Nick Piggin23044502011-01-07 17:49:31 +1100536 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100537}
538
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100539struct dentry *dget_parent(struct dentry *dentry)
540{
541 struct dentry *ret;
542
543repeat:
Nick Piggina734eb42011-01-07 17:49:44 +1100544 /*
545 * Don't need rcu_dereference because we re-check it was correct under
546 * the lock.
547 */
548 rcu_read_lock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100549 ret = dentry->d_parent;
Nick Piggina734eb42011-01-07 17:49:44 +1100550 if (!ret) {
551 rcu_read_unlock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100552 goto out;
553 }
Nick Piggina734eb42011-01-07 17:49:44 +1100554 spin_lock(&ret->d_lock);
555 if (unlikely(ret != dentry->d_parent)) {
556 spin_unlock(&ret->d_lock);
557 rcu_read_unlock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100558 goto repeat;
559 }
Nick Piggina734eb42011-01-07 17:49:44 +1100560 rcu_read_unlock();
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100561 BUG_ON(!ret->d_count);
562 ret->d_count++;
563 spin_unlock(&ret->d_lock);
564out:
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100565 return ret;
566}
567EXPORT_SYMBOL(dget_parent);
568
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569/**
570 * d_find_alias - grab a hashed alias of inode
571 * @inode: inode in question
572 * @want_discon: flag, used by d_splice_alias, to request
573 * that only a DISCONNECTED alias be returned.
574 *
575 * If inode has a hashed alias, or is a directory and has any alias,
576 * acquire the reference to alias and return it. Otherwise return NULL.
577 * Notice that if inode is a directory there can be only one alias and
578 * it can be unhashed only if it has no children, or if it is the root
579 * of a filesystem.
580 *
NeilBrown21c0d8f2006-10-04 02:16:16 -0700581 * If the inode has an IS_ROOT, DCACHE_DISCONNECTED alias, then prefer
Linus Torvalds1da177e2005-04-16 15:20:36 -0700582 * any other hashed alias over that one unless @want_discon is set,
NeilBrown21c0d8f2006-10-04 02:16:16 -0700583 * in which case only return an IS_ROOT, DCACHE_DISCONNECTED alias.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584 */
Nick Pigginda502952011-01-07 17:49:33 +1100585static struct dentry *__d_find_alias(struct inode *inode, int want_discon)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586{
Nick Pigginda502952011-01-07 17:49:33 +1100587 struct dentry *alias, *discon_alias;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588
Nick Pigginda502952011-01-07 17:49:33 +1100589again:
590 discon_alias = NULL;
591 list_for_each_entry(alias, &inode->i_dentry, d_alias) {
592 spin_lock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700593 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
NeilBrown21c0d8f2006-10-04 02:16:16 -0700594 if (IS_ROOT(alias) &&
Nick Pigginda502952011-01-07 17:49:33 +1100595 (alias->d_flags & DCACHE_DISCONNECTED)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596 discon_alias = alias;
Nick Pigginda502952011-01-07 17:49:33 +1100597 } else if (!want_discon) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100598 __dget_dlock(alias);
Nick Pigginda502952011-01-07 17:49:33 +1100599 spin_unlock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 return alias;
601 }
602 }
Nick Pigginda502952011-01-07 17:49:33 +1100603 spin_unlock(&alias->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 }
Nick Pigginda502952011-01-07 17:49:33 +1100605 if (discon_alias) {
606 alias = discon_alias;
607 spin_lock(&alias->d_lock);
608 if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
609 if (IS_ROOT(alias) &&
610 (alias->d_flags & DCACHE_DISCONNECTED)) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100611 __dget_dlock(alias);
Nick Pigginda502952011-01-07 17:49:33 +1100612 spin_unlock(&alias->d_lock);
613 return alias;
614 }
615 }
616 spin_unlock(&alias->d_lock);
617 goto again;
618 }
619 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620}
621
Nick Pigginda502952011-01-07 17:49:33 +1100622struct dentry *d_find_alias(struct inode *inode)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623{
David Howells214fda12006-03-25 03:06:36 -0800624 struct dentry *de = NULL;
625
626 if (!list_empty(&inode->i_dentry)) {
Nick Piggin873feea2011-01-07 17:50:06 +1100627 spin_lock(&inode->i_lock);
David Howells214fda12006-03-25 03:06:36 -0800628 de = __d_find_alias(inode, 0);
Nick Piggin873feea2011-01-07 17:50:06 +1100629 spin_unlock(&inode->i_lock);
David Howells214fda12006-03-25 03:06:36 -0800630 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 return de;
632}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700633EXPORT_SYMBOL(d_find_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634
635/*
636 * Try to kill dentries associated with this inode.
637 * WARNING: you must own a reference to inode.
638 */
639void d_prune_aliases(struct inode *inode)
640{
Domen Puncer0cdca3f2005-09-10 00:27:07 -0700641 struct dentry *dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642restart:
Nick Piggin873feea2011-01-07 17:50:06 +1100643 spin_lock(&inode->i_lock);
Domen Puncer0cdca3f2005-09-10 00:27:07 -0700644 list_for_each_entry(dentry, &inode->i_dentry, d_alias) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 spin_lock(&dentry->d_lock);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100646 if (!dentry->d_count) {
Nick Piggindc0474b2011-01-07 17:49:43 +1100647 __dget_dlock(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 __d_drop(dentry);
649 spin_unlock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +1100650 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651 dput(dentry);
652 goto restart;
653 }
654 spin_unlock(&dentry->d_lock);
655 }
Nick Piggin873feea2011-01-07 17:50:06 +1100656 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700658EXPORT_SYMBOL(d_prune_aliases);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700659
660/*
Nick Piggin77812a12011-01-07 17:49:48 +1100661 * Try to throw away a dentry - free the inode, dput the parent.
662 * Requires dentry->d_lock is held, and dentry->d_count == 0.
663 * Releases dentry->d_lock.
Andrew Mortond702ccb2006-06-22 14:47:31 -0700664 *
Nick Piggin77812a12011-01-07 17:49:48 +1100665 * This may fail if locks cannot be acquired no problem, just try again.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700666 */
Nick Piggin77812a12011-01-07 17:49:48 +1100667static void try_prune_one_dentry(struct dentry *dentry)
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +0200668 __releases(dentry->d_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669{
Nick Piggin77812a12011-01-07 17:49:48 +1100670 struct dentry *parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700671
Nick Piggin77812a12011-01-07 17:49:48 +1100672 parent = dentry_kill(dentry, 0);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700673 /*
Nick Piggin77812a12011-01-07 17:49:48 +1100674 * If dentry_kill returns NULL, we have nothing more to do.
675 * if it returns the same dentry, trylocks failed. In either
676 * case, just loop again.
677 *
678 * Otherwise, we need to prune ancestors too. This is necessary
679 * to prevent quadratic behavior of shrink_dcache_parent(), but
680 * is also expected to be beneficial in reducing dentry cache
681 * fragmentation.
Miklos Szeredid52b9082007-05-08 00:23:46 -0700682 */
Nick Piggin77812a12011-01-07 17:49:48 +1100683 if (!parent)
684 return;
685 if (parent == dentry)
686 return;
687
688 /* Prune ancestors. */
689 dentry = parent;
Miklos Szeredid52b9082007-05-08 00:23:46 -0700690 while (dentry) {
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100691 spin_lock(&dentry->d_lock);
Nick Piggin89e60542011-01-07 17:49:45 +1100692 if (dentry->d_count > 1) {
693 dentry->d_count--;
694 spin_unlock(&dentry->d_lock);
695 return;
696 }
Nick Piggin77812a12011-01-07 17:49:48 +1100697 dentry = dentry_kill(dentry, 1);
Miklos Szeredid52b9082007-05-08 00:23:46 -0700698 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700699}
700
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400701static void shrink_dentry_list(struct list_head *list)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700702{
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700703 struct dentry *dentry;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700704
Nick Pigginec336792011-01-07 17:49:47 +1100705 rcu_read_lock();
706 for (;;) {
Nick Pigginec336792011-01-07 17:49:47 +1100707 dentry = list_entry_rcu(list->prev, struct dentry, d_lru);
708 if (&dentry->d_lru == list)
709 break; /* empty */
710 spin_lock(&dentry->d_lock);
711 if (dentry != list_entry(list->prev, struct dentry, d_lru)) {
712 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100713 continue;
714 }
715
Linus Torvalds1da177e2005-04-16 15:20:36 -0700716 /*
717 * We found an inuse dentry which was not removed from
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700718 * the LRU because of laziness during lookup. Do not free
719 * it - just keep it off the LRU list.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720 */
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100721 if (dentry->d_count) {
Nick Pigginec336792011-01-07 17:49:47 +1100722 dentry_lru_del(dentry);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700723 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 continue;
725 }
Nick Pigginec336792011-01-07 17:49:47 +1100726
Nick Pigginec336792011-01-07 17:49:47 +1100727 rcu_read_unlock();
Nick Piggin77812a12011-01-07 17:49:48 +1100728
729 try_prune_one_dentry(dentry);
730
Nick Pigginec336792011-01-07 17:49:47 +1100731 rcu_read_lock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732 }
Nick Pigginec336792011-01-07 17:49:47 +1100733 rcu_read_unlock();
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400734}
735
736/**
737 * __shrink_dcache_sb - shrink the dentry LRU on a given superblock
738 * @sb: superblock to shrink dentry LRU.
739 * @count: number of entries to prune
740 * @flags: flags to control the dentry processing
741 *
742 * If flags contains DCACHE_REFERENCED reference dentries will not be pruned.
743 */
744static void __shrink_dcache_sb(struct super_block *sb, int *count, int flags)
745{
746 /* called from prune_dcache() and shrink_dcache_parent() */
747 struct dentry *dentry;
748 LIST_HEAD(referenced);
749 LIST_HEAD(tmp);
750 int cnt = *count;
751
Nick Piggin23044502011-01-07 17:49:31 +1100752relock:
753 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400754 while (!list_empty(&sb->s_dentry_lru)) {
755 dentry = list_entry(sb->s_dentry_lru.prev,
756 struct dentry, d_lru);
757 BUG_ON(dentry->d_sb != sb);
758
Nick Piggin23044502011-01-07 17:49:31 +1100759 if (!spin_trylock(&dentry->d_lock)) {
760 spin_unlock(&dcache_lru_lock);
761 cpu_relax();
762 goto relock;
763 }
764
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400765 /*
766 * If we are honouring the DCACHE_REFERENCED flag and the
767 * dentry has this flag set, don't free it. Clear the flag
768 * and put it back on the LRU.
769 */
Nick Piggin23044502011-01-07 17:49:31 +1100770 if (flags & DCACHE_REFERENCED &&
771 dentry->d_flags & DCACHE_REFERENCED) {
772 dentry->d_flags &= ~DCACHE_REFERENCED;
773 list_move(&dentry->d_lru, &referenced);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400774 spin_unlock(&dentry->d_lock);
Nick Piggin23044502011-01-07 17:49:31 +1100775 } else {
776 list_move_tail(&dentry->d_lru, &tmp);
777 spin_unlock(&dentry->d_lock);
778 if (!--cnt)
779 break;
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400780 }
Nick Pigginec336792011-01-07 17:49:47 +1100781 cond_resched_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400782 }
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700783 if (!list_empty(&referenced))
784 list_splice(&referenced, &sb->s_dentry_lru);
Nick Piggin23044502011-01-07 17:49:31 +1100785 spin_unlock(&dcache_lru_lock);
Nick Pigginec336792011-01-07 17:49:47 +1100786
787 shrink_dentry_list(&tmp);
788
789 *count = cnt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790}
791
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700792/**
793 * prune_dcache - shrink the dcache
794 * @count: number of entries to try to free
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 *
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700796 * Shrink the dcache. This is done when we need more memory, or simply when we
797 * need to unmount something (at which point we need to unuse all dentries).
798 *
799 * This function may fail to free any resources if all the dentries are in use.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700800 */
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700801static void prune_dcache(int count)
802{
Al Virodca33252010-07-25 02:31:46 +0400803 struct super_block *sb, *p = NULL;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700804 int w_count;
Nick Piggin86c87492011-01-07 17:49:18 +1100805 int unused = dentry_stat.nr_unused;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700806 int prune_ratio;
807 int pruned;
808
809 if (unused == 0 || count == 0)
810 return;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700811 if (count >= unused)
812 prune_ratio = 1;
813 else
814 prune_ratio = unused / count;
815 spin_lock(&sb_lock);
Al Virodca33252010-07-25 02:31:46 +0400816 list_for_each_entry(sb, &super_blocks, s_list) {
Al Viro551de6f2010-03-22 19:36:35 -0400817 if (list_empty(&sb->s_instances))
818 continue;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700819 if (sb->s_nr_dentry_unused == 0)
820 continue;
821 sb->s_count++;
822 /* Now, we reclaim unused dentrins with fairness.
823 * We reclaim them same percentage from each superblock.
824 * We calculate number of dentries to scan on this sb
825 * as follows, but the implementation is arranged to avoid
826 * overflows:
827 * number of dentries to scan on this sb =
828 * count * (number of dentries on this sb /
829 * number of dentries in the machine)
830 */
831 spin_unlock(&sb_lock);
832 if (prune_ratio != 1)
833 w_count = (sb->s_nr_dentry_unused / prune_ratio) + 1;
834 else
835 w_count = sb->s_nr_dentry_unused;
836 pruned = w_count;
837 /*
838 * We need to be sure this filesystem isn't being unmounted,
839 * otherwise we could race with generic_shutdown_super(), and
840 * end up holding a reference to an inode while the filesystem
841 * is unmounted. So we try to get s_umount, and make sure
842 * s_root isn't NULL.
843 */
844 if (down_read_trylock(&sb->s_umount)) {
845 if ((sb->s_root != NULL) &&
846 (!list_empty(&sb->s_dentry_lru))) {
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700847 __shrink_dcache_sb(sb, &w_count,
848 DCACHE_REFERENCED);
849 pruned -= w_count;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700850 }
851 up_read(&sb->s_umount);
852 }
853 spin_lock(&sb_lock);
Al Virodca33252010-07-25 02:31:46 +0400854 if (p)
855 __put_super(p);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700856 count -= pruned;
Al Virodca33252010-07-25 02:31:46 +0400857 p = sb;
Al Viro79893c12010-03-22 20:27:55 -0400858 /* more work left to do? */
859 if (count <= 0)
860 break;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700861 }
Al Virodca33252010-07-25 02:31:46 +0400862 if (p)
863 __put_super(p);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700864 spin_unlock(&sb_lock);
Kentaro Makitada3bbdd2008-07-23 21:27:13 -0700865}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866
867/**
868 * shrink_dcache_sb - shrink dcache for a superblock
869 * @sb: superblock
870 *
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400871 * Shrink the dcache for the specified super block. This is used to free
872 * the dcache before unmounting a file system.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700873 */
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400874void shrink_dcache_sb(struct super_block *sb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700875{
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400876 LIST_HEAD(tmp);
877
Nick Piggin23044502011-01-07 17:49:31 +1100878 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400879 while (!list_empty(&sb->s_dentry_lru)) {
880 list_splice_init(&sb->s_dentry_lru, &tmp);
Nick Pigginec336792011-01-07 17:49:47 +1100881 spin_unlock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400882 shrink_dentry_list(&tmp);
Nick Pigginec336792011-01-07 17:49:47 +1100883 spin_lock(&dcache_lru_lock);
Christoph Hellwig3049cfe2010-10-10 05:36:25 -0400884 }
Nick Piggin23044502011-01-07 17:49:31 +1100885 spin_unlock(&dcache_lru_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700886}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -0700887EXPORT_SYMBOL(shrink_dcache_sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888
889/*
David Howellsc636ebd2006-10-11 01:22:19 -0700890 * destroy a single subtree of dentries for unmount
891 * - see the comments on shrink_dcache_for_umount() for a description of the
892 * locking
893 */
894static void shrink_dcache_for_umount_subtree(struct dentry *dentry)
895{
896 struct dentry *parent;
David Howellsf8713572006-10-28 10:38:46 -0700897 unsigned detached = 0;
David Howellsc636ebd2006-10-11 01:22:19 -0700898
899 BUG_ON(!IS_ROOT(dentry));
900
901 /* detach this root from the system */
Nick Piggin23044502011-01-07 17:49:31 +1100902 spin_lock(&dentry->d_lock);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400903 dentry_lru_del(dentry);
David Howellsc636ebd2006-10-11 01:22:19 -0700904 __d_drop(dentry);
Nick Pigginda502952011-01-07 17:49:33 +1100905 spin_unlock(&dentry->d_lock);
David Howellsc636ebd2006-10-11 01:22:19 -0700906
907 for (;;) {
908 /* descend to the first leaf in the current subtree */
909 while (!list_empty(&dentry->d_subdirs)) {
910 struct dentry *loop;
911
912 /* this is a branch with children - detach all of them
913 * from the system in one go */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100914 spin_lock(&dentry->d_lock);
David Howellsc636ebd2006-10-11 01:22:19 -0700915 list_for_each_entry(loop, &dentry->d_subdirs,
916 d_u.d_child) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100917 spin_lock_nested(&loop->d_lock,
918 DENTRY_D_LOCK_NESTED);
Christoph Hellwiga4633352010-10-10 05:36:26 -0400919 dentry_lru_del(loop);
David Howellsc636ebd2006-10-11 01:22:19 -0700920 __d_drop(loop);
Nick Pigginda502952011-01-07 17:49:33 +1100921 spin_unlock(&loop->d_lock);
David Howellsc636ebd2006-10-11 01:22:19 -0700922 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100923 spin_unlock(&dentry->d_lock);
David Howellsc636ebd2006-10-11 01:22:19 -0700924
925 /* move to the first child */
926 dentry = list_entry(dentry->d_subdirs.next,
927 struct dentry, d_u.d_child);
928 }
929
930 /* consume the dentries from this leaf up through its parents
931 * until we find one with children or run out altogether */
932 do {
933 struct inode *inode;
934
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100935 if (dentry->d_count != 0) {
David Howellsc636ebd2006-10-11 01:22:19 -0700936 printk(KERN_ERR
937 "BUG: Dentry %p{i=%lx,n=%s}"
938 " still in use (%d)"
939 " [unmount of %s %s]\n",
940 dentry,
941 dentry->d_inode ?
942 dentry->d_inode->i_ino : 0UL,
943 dentry->d_name.name,
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100944 dentry->d_count,
David Howellsc636ebd2006-10-11 01:22:19 -0700945 dentry->d_sb->s_type->name,
946 dentry->d_sb->s_id);
947 BUG();
948 }
949
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100950 if (IS_ROOT(dentry)) {
David Howellsc636ebd2006-10-11 01:22:19 -0700951 parent = NULL;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100952 list_del(&dentry->d_u.d_child);
953 } else {
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900954 parent = dentry->d_parent;
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100955 spin_lock(&parent->d_lock);
956 parent->d_count--;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +1100957 list_del(&dentry->d_u.d_child);
Nick Pigginb7ab39f2011-01-07 17:49:32 +1100958 spin_unlock(&parent->d_lock);
OGAWA Hirofumi871c0062008-10-16 07:50:27 +0900959 }
David Howellsc636ebd2006-10-11 01:22:19 -0700960
David Howellsf8713572006-10-28 10:38:46 -0700961 detached++;
David Howellsc636ebd2006-10-11 01:22:19 -0700962
963 inode = dentry->d_inode;
964 if (inode) {
965 dentry->d_inode = NULL;
966 list_del_init(&dentry->d_alias);
967 if (dentry->d_op && dentry->d_op->d_iput)
968 dentry->d_op->d_iput(dentry, inode);
969 else
970 iput(inode);
971 }
972
973 d_free(dentry);
974
975 /* finished when we fall off the top of the tree,
976 * otherwise we ascend to the parent and move to the
977 * next sibling if there is one */
978 if (!parent)
Christoph Hellwig312d3ca2010-10-10 05:36:23 -0400979 return;
David Howellsc636ebd2006-10-11 01:22:19 -0700980 dentry = parent;
David Howellsc636ebd2006-10-11 01:22:19 -0700981 } while (list_empty(&dentry->d_subdirs));
982
983 dentry = list_entry(dentry->d_subdirs.next,
984 struct dentry, d_u.d_child);
985 }
986}
987
988/*
989 * destroy the dentries attached to a superblock on unmounting
Nick Pigginb5c84bf2011-01-07 17:49:38 +1100990 * - we don't need to use dentry->d_lock because:
David Howellsc636ebd2006-10-11 01:22:19 -0700991 * - the superblock is detached from all mountings and open files, so the
992 * dentry trees will not be rearranged by the VFS
993 * - s_umount is write-locked, so the memory pressure shrinker will ignore
994 * any dentries belonging to this superblock that it comes across
995 * - the filesystem itself is no longer permitted to rearrange the dentries
996 * in this superblock
997 */
998void shrink_dcache_for_umount(struct super_block *sb)
999{
1000 struct dentry *dentry;
1001
1002 if (down_read_trylock(&sb->s_umount))
1003 BUG();
1004
1005 dentry = sb->s_root;
1006 sb->s_root = NULL;
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001007 spin_lock(&dentry->d_lock);
1008 dentry->d_count--;
1009 spin_unlock(&dentry->d_lock);
David Howellsc636ebd2006-10-11 01:22:19 -07001010 shrink_dcache_for_umount_subtree(dentry);
1011
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001012 while (!hlist_bl_empty(&sb->s_anon)) {
1013 dentry = hlist_bl_entry(hlist_bl_first(&sb->s_anon), struct dentry, d_hash);
David Howellsc636ebd2006-10-11 01:22:19 -07001014 shrink_dcache_for_umount_subtree(dentry);
1015 }
1016}
1017
1018/*
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001019 * This tries to ascend one level of parenthood, but
1020 * we can race with renaming, so we need to re-check
1021 * the parenthood after dropping the lock and check
1022 * that the sequence number still matches.
1023 */
1024static struct dentry *try_to_ascend(struct dentry *old, int locked, unsigned seq)
1025{
1026 struct dentry *new = old->d_parent;
1027
1028 rcu_read_lock();
1029 spin_unlock(&old->d_lock);
1030 spin_lock(&new->d_lock);
1031
1032 /*
1033 * might go back up the wrong parent if we have had a rename
1034 * or deletion
1035 */
1036 if (new != old->d_parent ||
Trond Myklebustc83ce982011-03-15 13:36:43 -04001037 (old->d_flags & DCACHE_DISCONNECTED) ||
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001038 (!locked && read_seqretry(&rename_lock, seq))) {
1039 spin_unlock(&new->d_lock);
1040 new = NULL;
1041 }
1042 rcu_read_unlock();
1043 return new;
1044}
1045
1046
1047/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001048 * Search for at least 1 mount point in the dentry's subdirs.
1049 * We descend to the next level whenever the d_subdirs
1050 * list is non-empty and continue searching.
1051 */
1052
1053/**
1054 * have_submounts - check for mounts over a dentry
1055 * @parent: dentry to check.
1056 *
1057 * Return true if the parent or its subdirectories contain
1058 * a mount point
1059 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001060int have_submounts(struct dentry *parent)
1061{
Nick Piggin949854d2011-01-07 17:49:37 +11001062 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001063 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11001064 unsigned seq;
Nick Piggin58db63d2011-01-07 17:49:39 +11001065 int locked = 0;
Nick Piggin949854d2011-01-07 17:49:37 +11001066
Nick Piggin949854d2011-01-07 17:49:37 +11001067 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001068again:
1069 this_parent = parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001070
Linus Torvalds1da177e2005-04-16 15:20:36 -07001071 if (d_mountpoint(parent))
1072 goto positive;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001073 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001074repeat:
1075 next = this_parent->d_subdirs.next;
1076resume:
1077 while (next != &this_parent->d_subdirs) {
1078 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08001079 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001080 next = tmp->next;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001081
1082 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001083 /* Have we found a mount point ? */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001084 if (d_mountpoint(dentry)) {
1085 spin_unlock(&dentry->d_lock);
1086 spin_unlock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001087 goto positive;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001088 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001089 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001090 spin_unlock(&this_parent->d_lock);
1091 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001092 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001093 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 goto repeat;
1095 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001096 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001097 }
1098 /*
1099 * All done at this level ... ascend and resume the search.
1100 */
1101 if (this_parent != parent) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001102 struct dentry *child = this_parent;
1103 this_parent = try_to_ascend(this_parent, locked, seq);
1104 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11001105 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11001106 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001107 goto resume;
1108 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001109 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001110 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001111 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001112 if (locked)
1113 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001114 return 0; /* No mount points found in tree */
1115positive:
Nick Piggin58db63d2011-01-07 17:49:39 +11001116 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001117 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001118 if (locked)
1119 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001120 return 1;
Nick Piggin58db63d2011-01-07 17:49:39 +11001121
1122rename_retry:
1123 locked = 1;
1124 write_seqlock(&rename_lock);
1125 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001126}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001127EXPORT_SYMBOL(have_submounts);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128
1129/*
1130 * Search the dentry child list for the specified parent,
1131 * and move any unused dentries to the end of the unused
1132 * list for prune_dcache(). We descend to the next level
1133 * whenever the d_subdirs list is non-empty and continue
1134 * searching.
1135 *
1136 * It returns zero iff there are no unused children,
1137 * otherwise it returns the number of children moved to
1138 * the end of the unused list. This may not be the total
1139 * number of unused children, because select_parent can
1140 * drop the lock and return early due to latency
1141 * constraints.
1142 */
1143static int select_parent(struct dentry * parent)
1144{
Nick Piggin949854d2011-01-07 17:49:37 +11001145 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001146 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11001147 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001148 int found = 0;
Nick Piggin58db63d2011-01-07 17:49:39 +11001149 int locked = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001150
Nick Piggin949854d2011-01-07 17:49:37 +11001151 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001152again:
1153 this_parent = parent;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001154 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155repeat:
1156 next = this_parent->d_subdirs.next;
1157resume:
1158 while (next != &this_parent->d_subdirs) {
1159 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08001160 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 next = tmp->next;
1162
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001163 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Nick Piggin23044502011-01-07 17:49:31 +11001164
Linus Torvalds1da177e2005-04-16 15:20:36 -07001165 /*
1166 * move only zero ref count dentries to the end
1167 * of the unused list for prune_dcache
1168 */
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001169 if (!dentry->d_count) {
Christoph Hellwiga4633352010-10-10 05:36:26 -04001170 dentry_lru_move_tail(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001171 found++;
Christoph Hellwiga4633352010-10-10 05:36:26 -04001172 } else {
1173 dentry_lru_del(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001174 }
1175
1176 /*
1177 * We can return to the caller if we have found some (this
1178 * ensures forward progress). We'll be coming back to find
1179 * the rest.
1180 */
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001181 if (found && need_resched()) {
1182 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001183 goto out;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001184 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001185
1186 /*
1187 * Descend a level if the d_subdirs list is non-empty.
1188 */
1189 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001190 spin_unlock(&this_parent->d_lock);
1191 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001192 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001193 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001194 goto repeat;
1195 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001196
1197 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001198 }
1199 /*
1200 * All done at this level ... ascend and resume the search.
1201 */
1202 if (this_parent != parent) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07001203 struct dentry *child = this_parent;
1204 this_parent = try_to_ascend(this_parent, locked, seq);
1205 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11001206 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11001207 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001208 goto resume;
1209 }
1210out:
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001211 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11001212 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11001213 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11001214 if (locked)
1215 write_sequnlock(&rename_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 return found;
Nick Piggin58db63d2011-01-07 17:49:39 +11001217
1218rename_retry:
1219 if (found)
1220 return found;
1221 locked = 1;
1222 write_seqlock(&rename_lock);
1223 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224}
1225
1226/**
1227 * shrink_dcache_parent - prune dcache
1228 * @parent: parent of entries to prune
1229 *
1230 * Prune the dcache to remove unused children of the parent dentry.
1231 */
1232
1233void shrink_dcache_parent(struct dentry * parent)
1234{
Kentaro Makitada3bbdd2008-07-23 21:27:13 -07001235 struct super_block *sb = parent->d_sb;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001236 int found;
1237
1238 while ((found = select_parent(parent)) != 0)
Kentaro Makitada3bbdd2008-07-23 21:27:13 -07001239 __shrink_dcache_sb(sb, &found, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001240}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001241EXPORT_SYMBOL(shrink_dcache_parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001242
Linus Torvalds1da177e2005-04-16 15:20:36 -07001243/*
1244 * Scan `nr' dentries and return the number which remain.
1245 *
1246 * We need to avoid reentering the filesystem if the caller is performing a
1247 * GFP_NOFS allocation attempt. One example deadlock is:
1248 *
1249 * ext2_new_block->getblk->GFP->shrink_dcache_memory->prune_dcache->
1250 * prune_one_dentry->dput->dentry_iput->iput->inode->i_sb->s_op->put_inode->
1251 * ext2_discard_prealloc->ext2_free_blocks->lock_super->DEADLOCK.
1252 *
1253 * In this case we return -1 to tell the caller that we baled.
1254 */
Dave Chinner7f8275d2010-07-19 14:56:17 +10001255static int shrink_dcache_memory(struct shrinker *shrink, int nr, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256{
1257 if (nr) {
1258 if (!(gfp_mask & __GFP_FS))
1259 return -1;
Kentaro Makitada3bbdd2008-07-23 21:27:13 -07001260 prune_dcache(nr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001261 }
Christoph Hellwig312d3ca2010-10-10 05:36:23 -04001262
Nick Piggin86c87492011-01-07 17:49:18 +11001263 return (dentry_stat.nr_unused / 100) * sysctl_vfs_cache_pressure;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001264}
1265
Rusty Russell8e1f9362007-07-17 04:03:17 -07001266static struct shrinker dcache_shrinker = {
1267 .shrink = shrink_dcache_memory,
1268 .seeks = DEFAULT_SEEKS,
1269};
1270
Linus Torvalds1da177e2005-04-16 15:20:36 -07001271/**
1272 * d_alloc - allocate a dcache entry
1273 * @parent: parent of entry to allocate
1274 * @name: qstr of the name
1275 *
1276 * Allocates a dentry. It returns %NULL if there is insufficient memory
1277 * available. On a success the dentry is returned. The name passed in is
1278 * copied and the copy passed in may be reused after this call.
1279 */
1280
1281struct dentry *d_alloc(struct dentry * parent, const struct qstr *name)
1282{
1283 struct dentry *dentry;
1284 char *dname;
1285
Mel Gormane12ba742007-10-16 01:25:52 -07001286 dentry = kmem_cache_alloc(dentry_cache, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001287 if (!dentry)
1288 return NULL;
1289
1290 if (name->len > DNAME_INLINE_LEN-1) {
1291 dname = kmalloc(name->len + 1, GFP_KERNEL);
1292 if (!dname) {
1293 kmem_cache_free(dentry_cache, dentry);
1294 return NULL;
1295 }
1296 } else {
1297 dname = dentry->d_iname;
1298 }
1299 dentry->d_name.name = dname;
1300
1301 dentry->d_name.len = name->len;
1302 dentry->d_name.hash = name->hash;
1303 memcpy(dname, name->name, name->len);
1304 dname[name->len] = 0;
1305
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001306 dentry->d_count = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001307 dentry->d_flags = DCACHE_UNHASHED;
1308 spin_lock_init(&dentry->d_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +11001309 seqcount_init(&dentry->d_seq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001310 dentry->d_inode = NULL;
1311 dentry->d_parent = NULL;
1312 dentry->d_sb = NULL;
1313 dentry->d_op = NULL;
1314 dentry->d_fsdata = NULL;
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001315 INIT_HLIST_BL_NODE(&dentry->d_hash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001316 INIT_LIST_HEAD(&dentry->d_lru);
1317 INIT_LIST_HEAD(&dentry->d_subdirs);
1318 INIT_LIST_HEAD(&dentry->d_alias);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001319 INIT_LIST_HEAD(&dentry->d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001320
1321 if (parent) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001322 spin_lock(&parent->d_lock);
Nick Piggin89ad4852011-01-07 17:49:41 +11001323 /*
1324 * don't need child lock because it is not subject
1325 * to concurrency here
1326 */
Nick Piggindc0474b2011-01-07 17:49:43 +11001327 __dget_dlock(parent);
1328 dentry->d_parent = parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001329 dentry->d_sb = parent->d_sb;
Al Viroc8aebb02010-12-18 10:22:30 -05001330 d_set_d_op(dentry, dentry->d_sb->s_d_op);
Eric Dumazet5160ee62006-01-08 01:03:32 -08001331 list_add(&dentry->d_u.d_child, &parent->d_subdirs);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001332 spin_unlock(&parent->d_lock);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11001333 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001334
Nick Piggin3e880fb2011-01-07 17:49:19 +11001335 this_cpu_inc(nr_dentry);
Christoph Hellwig312d3ca2010-10-10 05:36:23 -04001336
Linus Torvalds1da177e2005-04-16 15:20:36 -07001337 return dentry;
1338}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001339EXPORT_SYMBOL(d_alloc);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001340
Nick Piggin4b936882011-01-07 17:50:07 +11001341struct dentry *d_alloc_pseudo(struct super_block *sb, const struct qstr *name)
1342{
1343 struct dentry *dentry = d_alloc(NULL, name);
1344 if (dentry) {
1345 dentry->d_sb = sb;
Al Viroc8aebb02010-12-18 10:22:30 -05001346 d_set_d_op(dentry, dentry->d_sb->s_d_op);
Nick Piggin4b936882011-01-07 17:50:07 +11001347 dentry->d_parent = dentry;
1348 dentry->d_flags |= DCACHE_DISCONNECTED;
1349 }
1350 return dentry;
1351}
1352EXPORT_SYMBOL(d_alloc_pseudo);
1353
Linus Torvalds1da177e2005-04-16 15:20:36 -07001354struct dentry *d_alloc_name(struct dentry *parent, const char *name)
1355{
1356 struct qstr q;
1357
1358 q.name = name;
1359 q.len = strlen(name);
1360 q.hash = full_name_hash(q.name, q.len);
1361 return d_alloc(parent, &q);
1362}
H Hartley Sweetenef26ca92009-09-29 20:09:42 -04001363EXPORT_SYMBOL(d_alloc_name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001364
Nick Pigginfb045ad2011-01-07 17:49:55 +11001365void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op)
1366{
Linus Torvalds6f7f7ca2011-01-14 13:26:18 -08001367 WARN_ON_ONCE(dentry->d_op);
1368 WARN_ON_ONCE(dentry->d_flags & (DCACHE_OP_HASH |
Nick Pigginfb045ad2011-01-07 17:49:55 +11001369 DCACHE_OP_COMPARE |
1370 DCACHE_OP_REVALIDATE |
1371 DCACHE_OP_DELETE ));
1372 dentry->d_op = op;
1373 if (!op)
1374 return;
1375 if (op->d_hash)
1376 dentry->d_flags |= DCACHE_OP_HASH;
1377 if (op->d_compare)
1378 dentry->d_flags |= DCACHE_OP_COMPARE;
1379 if (op->d_revalidate)
1380 dentry->d_flags |= DCACHE_OP_REVALIDATE;
1381 if (op->d_delete)
1382 dentry->d_flags |= DCACHE_OP_DELETE;
1383
1384}
1385EXPORT_SYMBOL(d_set_d_op);
1386
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001387static void __d_instantiate(struct dentry *dentry, struct inode *inode)
1388{
Nick Pigginb23fb0a2011-01-07 17:49:35 +11001389 spin_lock(&dentry->d_lock);
David Howells9875cf82011-01-14 18:45:21 +00001390 if (inode) {
1391 if (unlikely(IS_AUTOMOUNT(inode)))
1392 dentry->d_flags |= DCACHE_NEED_AUTOMOUNT;
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001393 list_add(&dentry->d_alias, &inode->i_dentry);
David Howells9875cf82011-01-14 18:45:21 +00001394 }
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001395 dentry->d_inode = inode;
Nick Piggin31e6b012011-01-07 17:49:52 +11001396 dentry_rcuwalk_barrier(dentry);
Nick Pigginb23fb0a2011-01-07 17:49:35 +11001397 spin_unlock(&dentry->d_lock);
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001398 fsnotify_d_instantiate(dentry, inode);
1399}
1400
Linus Torvalds1da177e2005-04-16 15:20:36 -07001401/**
1402 * d_instantiate - fill in inode information for a dentry
1403 * @entry: dentry to complete
1404 * @inode: inode to attach to this dentry
1405 *
1406 * Fill in inode information in the entry.
1407 *
1408 * This turns negative dentries into productive full members
1409 * of society.
1410 *
1411 * NOTE! This assumes that the inode count has been incremented
1412 * (or otherwise set) by the caller to indicate that it is now
1413 * in use by the dcache.
1414 */
1415
1416void d_instantiate(struct dentry *entry, struct inode * inode)
1417{
Eric Sesterhenn28133c72006-03-26 18:25:39 +02001418 BUG_ON(!list_empty(&entry->d_alias));
Nick Piggin873feea2011-01-07 17:50:06 +11001419 if (inode)
1420 spin_lock(&inode->i_lock);
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001421 __d_instantiate(entry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001422 if (inode)
1423 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424 security_d_instantiate(entry, inode);
1425}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001426EXPORT_SYMBOL(d_instantiate);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001427
1428/**
1429 * d_instantiate_unique - instantiate a non-aliased dentry
1430 * @entry: dentry to instantiate
1431 * @inode: inode to attach to this dentry
1432 *
1433 * Fill in inode information in the entry. On success, it returns NULL.
1434 * If an unhashed alias of "entry" already exists, then we return the
Oleg Drokine866cfa2006-01-09 20:52:51 -08001435 * aliased dentry instead and drop one reference to inode.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001436 *
1437 * Note that in order to avoid conflicts with rename() etc, the caller
1438 * had better be holding the parent directory semaphore.
Oleg Drokine866cfa2006-01-09 20:52:51 -08001439 *
1440 * This also assumes that the inode count has been incremented
1441 * (or otherwise set) by the caller to indicate that it is now
1442 * in use by the dcache.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001443 */
David Howells770bfad2006-08-22 20:06:07 -04001444static struct dentry *__d_instantiate_unique(struct dentry *entry,
1445 struct inode *inode)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001446{
1447 struct dentry *alias;
1448 int len = entry->d_name.len;
1449 const char *name = entry->d_name.name;
1450 unsigned int hash = entry->d_name.hash;
1451
David Howells770bfad2006-08-22 20:06:07 -04001452 if (!inode) {
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001453 __d_instantiate(entry, NULL);
David Howells770bfad2006-08-22 20:06:07 -04001454 return NULL;
1455 }
1456
Linus Torvalds1da177e2005-04-16 15:20:36 -07001457 list_for_each_entry(alias, &inode->i_dentry, d_alias) {
1458 struct qstr *qstr = &alias->d_name;
1459
Nick Piggin9abca362011-01-07 17:49:36 +11001460 /*
1461 * Don't need alias->d_lock here, because aliases with
1462 * d_parent == entry->d_parent are not subject to name or
1463 * parent changes, because the parent inode i_mutex is held.
1464 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001465 if (qstr->hash != hash)
1466 continue;
1467 if (alias->d_parent != entry->d_parent)
1468 continue;
Nick Piggin9d55c362011-01-07 17:50:09 +11001469 if (dentry_cmp(qstr->name, qstr->len, name, len))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001470 continue;
Nick Piggindc0474b2011-01-07 17:49:43 +11001471 __dget(alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001472 return alias;
1473 }
David Howells770bfad2006-08-22 20:06:07 -04001474
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001475 __d_instantiate(entry, inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001476 return NULL;
1477}
David Howells770bfad2006-08-22 20:06:07 -04001478
1479struct dentry *d_instantiate_unique(struct dentry *entry, struct inode *inode)
1480{
1481 struct dentry *result;
1482
1483 BUG_ON(!list_empty(&entry->d_alias));
1484
Nick Piggin873feea2011-01-07 17:50:06 +11001485 if (inode)
1486 spin_lock(&inode->i_lock);
David Howells770bfad2006-08-22 20:06:07 -04001487 result = __d_instantiate_unique(entry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001488 if (inode)
1489 spin_unlock(&inode->i_lock);
David Howells770bfad2006-08-22 20:06:07 -04001490
1491 if (!result) {
1492 security_d_instantiate(entry, inode);
1493 return NULL;
1494 }
1495
1496 BUG_ON(!d_unhashed(result));
1497 iput(inode);
1498 return result;
1499}
1500
Linus Torvalds1da177e2005-04-16 15:20:36 -07001501EXPORT_SYMBOL(d_instantiate_unique);
1502
1503/**
1504 * d_alloc_root - allocate root dentry
1505 * @root_inode: inode to allocate the root for
1506 *
1507 * Allocate a root ("/") dentry for the inode given. The inode is
1508 * instantiated and returned. %NULL is returned if there is insufficient
1509 * memory or the inode passed is %NULL.
1510 */
1511
1512struct dentry * d_alloc_root(struct inode * root_inode)
1513{
1514 struct dentry *res = NULL;
1515
1516 if (root_inode) {
1517 static const struct qstr name = { .name = "/", .len = 1 };
1518
1519 res = d_alloc(NULL, &name);
1520 if (res) {
1521 res->d_sb = root_inode->i_sb;
Al Viroc8aebb02010-12-18 10:22:30 -05001522 d_set_d_op(res, res->d_sb->s_d_op);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001523 res->d_parent = res;
1524 d_instantiate(res, root_inode);
1525 }
1526 }
1527 return res;
1528}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001529EXPORT_SYMBOL(d_alloc_root);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001530
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001531static struct dentry * __d_find_any_alias(struct inode *inode)
1532{
1533 struct dentry *alias;
1534
1535 if (list_empty(&inode->i_dentry))
1536 return NULL;
1537 alias = list_first_entry(&inode->i_dentry, struct dentry, d_alias);
1538 __dget(alias);
1539 return alias;
1540}
1541
1542static struct dentry * d_find_any_alias(struct inode *inode)
1543{
1544 struct dentry *de;
1545
1546 spin_lock(&inode->i_lock);
1547 de = __d_find_any_alias(inode);
1548 spin_unlock(&inode->i_lock);
1549 return de;
1550}
1551
1552
Linus Torvalds1da177e2005-04-16 15:20:36 -07001553/**
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001554 * d_obtain_alias - find or allocate a dentry for a given inode
1555 * @inode: inode to allocate the dentry for
1556 *
1557 * Obtain a dentry for an inode resulting from NFS filehandle conversion or
1558 * similar open by handle operations. The returned dentry may be anonymous,
1559 * or may have a full name (if the inode was already in the cache).
1560 *
1561 * When called on a directory inode, we must ensure that the inode only ever
1562 * has one dentry. If a dentry is found, that is returned instead of
1563 * allocating a new one.
1564 *
1565 * On successful return, the reference to the inode has been transferred
Christoph Hellwig44003722008-08-11 15:49:04 +02001566 * to the dentry. In case of an error the reference on the inode is released.
1567 * To make it easier to use in export operations a %NULL or IS_ERR inode may
1568 * be passed in and will be the error will be propagate to the return value,
1569 * with a %NULL @inode replaced by ERR_PTR(-ESTALE).
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001570 */
1571struct dentry *d_obtain_alias(struct inode *inode)
1572{
Christoph Hellwig9308a612008-08-11 15:49:12 +02001573 static const struct qstr anonstring = { .name = "" };
1574 struct dentry *tmp;
1575 struct dentry *res;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001576
1577 if (!inode)
Christoph Hellwig44003722008-08-11 15:49:04 +02001578 return ERR_PTR(-ESTALE);
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001579 if (IS_ERR(inode))
1580 return ERR_CAST(inode);
1581
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001582 res = d_find_any_alias(inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001583 if (res)
1584 goto out_iput;
1585
1586 tmp = d_alloc(NULL, &anonstring);
1587 if (!tmp) {
1588 res = ERR_PTR(-ENOMEM);
1589 goto out_iput;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001590 }
Christoph Hellwig9308a612008-08-11 15:49:12 +02001591 tmp->d_parent = tmp; /* make sure dput doesn't croak */
1592
Nick Pigginb5c84bf2011-01-07 17:49:38 +11001593
Nick Piggin873feea2011-01-07 17:50:06 +11001594 spin_lock(&inode->i_lock);
J. Bruce Fieldsd891eed2011-01-18 15:45:09 -05001595 res = __d_find_any_alias(inode);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001596 if (res) {
Nick Piggin873feea2011-01-07 17:50:06 +11001597 spin_unlock(&inode->i_lock);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001598 dput(tmp);
1599 goto out_iput;
1600 }
1601
1602 /* attach a disconnected dentry */
1603 spin_lock(&tmp->d_lock);
1604 tmp->d_sb = inode->i_sb;
Al Viroc8aebb02010-12-18 10:22:30 -05001605 d_set_d_op(tmp, tmp->d_sb->s_d_op);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001606 tmp->d_inode = inode;
1607 tmp->d_flags |= DCACHE_DISCONNECTED;
Christoph Hellwig9308a612008-08-11 15:49:12 +02001608 list_add(&tmp->d_alias, &inode->i_dentry);
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001609 bit_spin_lock(0, (unsigned long *)&tmp->d_sb->s_anon.first);
1610 tmp->d_flags &= ~DCACHE_UNHASHED;
1611 hlist_bl_add_head(&tmp->d_hash, &tmp->d_sb->s_anon);
1612 __bit_spin_unlock(0, (unsigned long *)&tmp->d_sb->s_anon.first);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001613 spin_unlock(&tmp->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11001614 spin_unlock(&inode->i_lock);
Christoph Hellwig9308a612008-08-11 15:49:12 +02001615
Christoph Hellwig9308a612008-08-11 15:49:12 +02001616 return tmp;
1617
1618 out_iput:
1619 iput(inode);
1620 return res;
Christoph Hellwig4ea3ada2008-08-11 15:48:57 +02001621}
Benny Halevyadc48722009-02-27 14:02:59 -08001622EXPORT_SYMBOL(d_obtain_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001623
1624/**
1625 * d_splice_alias - splice a disconnected dentry into the tree if one exists
1626 * @inode: the inode which may have a disconnected dentry
1627 * @dentry: a negative dentry which we want to point to the inode.
1628 *
1629 * If inode is a directory and has a 'disconnected' dentry (i.e. IS_ROOT and
1630 * DCACHE_DISCONNECTED), then d_move that in place of the given dentry
1631 * and return it, else simply d_add the inode to the dentry and return NULL.
1632 *
1633 * This is needed in the lookup routine of any filesystem that is exportable
1634 * (via knfsd) so that we can build dcache paths to directories effectively.
1635 *
1636 * If a dentry was found and moved, then it is returned. Otherwise NULL
1637 * is returned. This matches the expected return value of ->lookup.
1638 *
1639 */
1640struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry)
1641{
1642 struct dentry *new = NULL;
1643
NeilBrown21c0d8f2006-10-04 02:16:16 -07001644 if (inode && S_ISDIR(inode->i_mode)) {
Nick Piggin873feea2011-01-07 17:50:06 +11001645 spin_lock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001646 new = __d_find_alias(inode, 1);
1647 if (new) {
1648 BUG_ON(!(new->d_flags & DCACHE_DISCONNECTED));
Nick Piggin873feea2011-01-07 17:50:06 +11001649 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001650 security_d_instantiate(new, inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001651 d_move(new, dentry);
1652 iput(inode);
1653 } else {
Nick Piggin873feea2011-01-07 17:50:06 +11001654 /* already taking inode->i_lock, so d_add() by hand */
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001655 __d_instantiate(dentry, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001656 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001657 security_d_instantiate(dentry, inode);
1658 d_rehash(dentry);
1659 }
1660 } else
1661 d_add(dentry, inode);
1662 return new;
1663}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001664EXPORT_SYMBOL(d_splice_alias);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001665
Barry Naujok94035402008-05-21 16:50:46 +10001666/**
1667 * d_add_ci - lookup or allocate new dentry with case-exact name
1668 * @inode: the inode case-insensitive lookup has found
1669 * @dentry: the negative dentry that was passed to the parent's lookup func
1670 * @name: the case-exact name to be associated with the returned dentry
1671 *
1672 * This is to avoid filling the dcache with case-insensitive names to the
1673 * same inode, only the actual correct case is stored in the dcache for
1674 * case-insensitive filesystems.
1675 *
1676 * For a case-insensitive lookup match and if the the case-exact dentry
1677 * already exists in in the dcache, use it and return it.
1678 *
1679 * If no entry exists with the exact case name, allocate new dentry with
1680 * the exact case, and return the spliced entry.
1681 */
Christoph Hellwige45b5902008-08-07 23:49:07 +02001682struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode,
Barry Naujok94035402008-05-21 16:50:46 +10001683 struct qstr *name)
1684{
1685 int error;
1686 struct dentry *found;
1687 struct dentry *new;
1688
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001689 /*
1690 * First check if a dentry matching the name already exists,
1691 * if not go ahead and create it now.
1692 */
Barry Naujok94035402008-05-21 16:50:46 +10001693 found = d_hash_and_lookup(dentry->d_parent, name);
Barry Naujok94035402008-05-21 16:50:46 +10001694 if (!found) {
1695 new = d_alloc(dentry->d_parent, name);
1696 if (!new) {
1697 error = -ENOMEM;
1698 goto err_out;
1699 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001700
Barry Naujok94035402008-05-21 16:50:46 +10001701 found = d_splice_alias(inode, new);
1702 if (found) {
1703 dput(new);
1704 return found;
1705 }
1706 return new;
1707 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001708
1709 /*
1710 * If a matching dentry exists, and it's not negative use it.
1711 *
1712 * Decrement the reference count to balance the iget() done
1713 * earlier on.
1714 */
Barry Naujok94035402008-05-21 16:50:46 +10001715 if (found->d_inode) {
1716 if (unlikely(found->d_inode != inode)) {
1717 /* This can't happen because bad inodes are unhashed. */
1718 BUG_ON(!is_bad_inode(inode));
1719 BUG_ON(!is_bad_inode(found->d_inode));
1720 }
Barry Naujok94035402008-05-21 16:50:46 +10001721 iput(inode);
1722 return found;
1723 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001724
Barry Naujok94035402008-05-21 16:50:46 +10001725 /*
1726 * Negative dentry: instantiate it unless the inode is a directory and
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001727 * already has a dentry.
Barry Naujok94035402008-05-21 16:50:46 +10001728 */
Nick Piggin873feea2011-01-07 17:50:06 +11001729 spin_lock(&inode->i_lock);
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001730 if (!S_ISDIR(inode->i_mode) || list_empty(&inode->i_dentry)) {
OGAWA Hirofumi360da902008-10-16 07:50:28 +09001731 __d_instantiate(found, inode);
Nick Piggin873feea2011-01-07 17:50:06 +11001732 spin_unlock(&inode->i_lock);
Barry Naujok94035402008-05-21 16:50:46 +10001733 security_d_instantiate(found, inode);
1734 return found;
1735 }
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001736
Barry Naujok94035402008-05-21 16:50:46 +10001737 /*
Christoph Hellwigb6520c82009-01-05 19:10:37 +01001738 * In case a directory already has a (disconnected) entry grab a
1739 * reference to it, move it in place and use it.
Barry Naujok94035402008-05-21 16:50:46 +10001740 */
1741 new = list_entry(inode->i_dentry.next, struct dentry, d_alias);
Nick Piggindc0474b2011-01-07 17:49:43 +11001742 __dget(new);
Nick Piggin873feea2011-01-07 17:50:06 +11001743 spin_unlock(&inode->i_lock);
Barry Naujok94035402008-05-21 16:50:46 +10001744 security_d_instantiate(found, inode);
Barry Naujok94035402008-05-21 16:50:46 +10001745 d_move(new, found);
Barry Naujok94035402008-05-21 16:50:46 +10001746 iput(inode);
Barry Naujok94035402008-05-21 16:50:46 +10001747 dput(found);
Barry Naujok94035402008-05-21 16:50:46 +10001748 return new;
1749
1750err_out:
1751 iput(inode);
1752 return ERR_PTR(error);
1753}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001754EXPORT_SYMBOL(d_add_ci);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001755
1756/**
Nick Piggin31e6b012011-01-07 17:49:52 +11001757 * __d_lookup_rcu - search for a dentry (racy, store-free)
1758 * @parent: parent dentry
1759 * @name: qstr of name we wish to find
1760 * @seq: returns d_seq value at the point where the dentry was found
1761 * @inode: returns dentry->d_inode when the inode was found valid.
1762 * Returns: dentry, or NULL
1763 *
1764 * __d_lookup_rcu is the dcache lookup function for rcu-walk name
1765 * resolution (store-free path walking) design described in
1766 * Documentation/filesystems/path-lookup.txt.
1767 *
1768 * This is not to be used outside core vfs.
1769 *
1770 * __d_lookup_rcu must only be used in rcu-walk mode, ie. with vfsmount lock
1771 * held, and rcu_read_lock held. The returned dentry must not be stored into
1772 * without taking d_lock and checking d_seq sequence count against @seq
1773 * returned here.
1774 *
1775 * A refcount may be taken on the found dentry with the __d_rcu_to_refcount
1776 * function.
1777 *
1778 * Alternatively, __d_lookup_rcu may be called again to look up the child of
1779 * the returned dentry, so long as its parent's seqlock is checked after the
1780 * child is looked up. Thus, an interlocking stepping of sequence lock checks
1781 * is formed, giving integrity down the path walk.
1782 */
1783struct dentry *__d_lookup_rcu(struct dentry *parent, struct qstr *name,
1784 unsigned *seq, struct inode **inode)
1785{
1786 unsigned int len = name->len;
1787 unsigned int hash = name->hash;
1788 const unsigned char *str = name->name;
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001789 struct dcache_hash_bucket *b = d_hash(parent, hash);
1790 struct hlist_bl_node *node;
Nick Piggin31e6b012011-01-07 17:49:52 +11001791 struct dentry *dentry;
1792
1793 /*
1794 * Note: There is significant duplication with __d_lookup_rcu which is
1795 * required to prevent single threaded performance regressions
1796 * especially on architectures where smp_rmb (in seqcounts) are costly.
1797 * Keep the two functions in sync.
1798 */
1799
1800 /*
1801 * The hash list is protected using RCU.
1802 *
1803 * Carefully use d_seq when comparing a candidate dentry, to avoid
1804 * races with d_move().
1805 *
1806 * It is possible that concurrent renames can mess up our list
1807 * walk here and result in missing our dentry, resulting in the
1808 * false-negative result. d_lookup() protects against concurrent
1809 * renames using rename_lock seqlock.
1810 *
1811 * See Documentation/vfs/dcache-locking.txt for more details.
1812 */
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001813 hlist_bl_for_each_entry_rcu(dentry, node, &b->head, d_hash) {
Nick Piggin31e6b012011-01-07 17:49:52 +11001814 struct inode *i;
1815 const char *tname;
1816 int tlen;
1817
1818 if (dentry->d_name.hash != hash)
1819 continue;
1820
1821seqretry:
1822 *seq = read_seqcount_begin(&dentry->d_seq);
1823 if (dentry->d_parent != parent)
1824 continue;
1825 if (d_unhashed(dentry))
1826 continue;
1827 tlen = dentry->d_name.len;
1828 tname = dentry->d_name.name;
1829 i = dentry->d_inode;
Nick Piggine1bb5782011-01-07 17:50:08 +11001830 prefetch(tname);
1831 if (i)
1832 prefetch(i);
Nick Piggin31e6b012011-01-07 17:49:52 +11001833 /*
1834 * This seqcount check is required to ensure name and
1835 * len are loaded atomically, so as not to walk off the
1836 * edge of memory when walking. If we could load this
1837 * atomically some other way, we could drop this check.
1838 */
1839 if (read_seqcount_retry(&dentry->d_seq, *seq))
1840 goto seqretry;
Nick Pigginfb045ad2011-01-07 17:49:55 +11001841 if (parent->d_flags & DCACHE_OP_COMPARE) {
Nick Piggin31e6b012011-01-07 17:49:52 +11001842 if (parent->d_op->d_compare(parent, *inode,
1843 dentry, i,
1844 tlen, tname, name))
1845 continue;
1846 } else {
Nick Piggin9d55c362011-01-07 17:50:09 +11001847 if (dentry_cmp(tname, tlen, str, len))
Nick Piggin31e6b012011-01-07 17:49:52 +11001848 continue;
1849 }
1850 /*
1851 * No extra seqcount check is required after the name
1852 * compare. The caller must perform a seqcount check in
1853 * order to do anything useful with the returned dentry
1854 * anyway.
1855 */
1856 *inode = i;
1857 return dentry;
1858 }
1859 return NULL;
1860}
1861
1862/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07001863 * d_lookup - search for a dentry
1864 * @parent: parent dentry
1865 * @name: qstr of name we wish to find
Nick Pigginb04f7842010-08-18 04:37:34 +10001866 * Returns: dentry, or NULL
Linus Torvalds1da177e2005-04-16 15:20:36 -07001867 *
Nick Pigginb04f7842010-08-18 04:37:34 +10001868 * d_lookup searches the children of the parent dentry for the name in
1869 * question. If the dentry is found its reference count is incremented and the
1870 * dentry is returned. The caller must use dput to free the entry when it has
1871 * finished using it. %NULL is returned if the dentry does not exist.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001872 */
Nick Piggin31e6b012011-01-07 17:49:52 +11001873struct dentry *d_lookup(struct dentry *parent, struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001874{
Nick Piggin31e6b012011-01-07 17:49:52 +11001875 struct dentry *dentry;
Nick Piggin949854d2011-01-07 17:49:37 +11001876 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001877
1878 do {
1879 seq = read_seqbegin(&rename_lock);
1880 dentry = __d_lookup(parent, name);
1881 if (dentry)
1882 break;
1883 } while (read_seqretry(&rename_lock, seq));
1884 return dentry;
1885}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07001886EXPORT_SYMBOL(d_lookup);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001887
Nick Piggin31e6b012011-01-07 17:49:52 +11001888/**
Nick Pigginb04f7842010-08-18 04:37:34 +10001889 * __d_lookup - search for a dentry (racy)
1890 * @parent: parent dentry
1891 * @name: qstr of name we wish to find
1892 * Returns: dentry, or NULL
1893 *
1894 * __d_lookup is like d_lookup, however it may (rarely) return a
1895 * false-negative result due to unrelated rename activity.
1896 *
1897 * __d_lookup is slightly faster by avoiding rename_lock read seqlock,
1898 * however it must be used carefully, eg. with a following d_lookup in
1899 * the case of failure.
1900 *
1901 * __d_lookup callers must be commented.
1902 */
Nick Piggin31e6b012011-01-07 17:49:52 +11001903struct dentry *__d_lookup(struct dentry *parent, struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001904{
1905 unsigned int len = name->len;
1906 unsigned int hash = name->hash;
1907 const unsigned char *str = name->name;
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001908 struct dcache_hash_bucket *b = d_hash(parent, hash);
1909 struct hlist_bl_node *node;
Nick Piggin31e6b012011-01-07 17:49:52 +11001910 struct dentry *found = NULL;
Paul E. McKenney665a7582005-11-07 00:59:17 -08001911 struct dentry *dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001912
Nick Pigginb04f7842010-08-18 04:37:34 +10001913 /*
Nick Piggin31e6b012011-01-07 17:49:52 +11001914 * Note: There is significant duplication with __d_lookup_rcu which is
1915 * required to prevent single threaded performance regressions
1916 * especially on architectures where smp_rmb (in seqcounts) are costly.
1917 * Keep the two functions in sync.
1918 */
1919
1920 /*
Nick Pigginb04f7842010-08-18 04:37:34 +10001921 * The hash list is protected using RCU.
1922 *
1923 * Take d_lock when comparing a candidate dentry, to avoid races
1924 * with d_move().
1925 *
1926 * It is possible that concurrent renames can mess up our list
1927 * walk here and result in missing our dentry, resulting in the
1928 * false-negative result. d_lookup() protects against concurrent
1929 * renames using rename_lock seqlock.
1930 *
1931 * See Documentation/vfs/dcache-locking.txt for more details.
1932 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001933 rcu_read_lock();
1934
Nick Pigginceb5bdc2011-01-07 17:50:05 +11001935 hlist_bl_for_each_entry_rcu(dentry, node, &b->head, d_hash) {
Nick Piggin31e6b012011-01-07 17:49:52 +11001936 const char *tname;
1937 int tlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001938
Linus Torvalds1da177e2005-04-16 15:20:36 -07001939 if (dentry->d_name.hash != hash)
1940 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001941
1942 spin_lock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001943 if (dentry->d_parent != parent)
1944 goto next;
Linus Torvaldsd0185c02008-09-29 07:42:57 -07001945 if (d_unhashed(dentry))
1946 goto next;
1947
Linus Torvalds1da177e2005-04-16 15:20:36 -07001948 /*
1949 * It is safe to compare names since d_move() cannot
1950 * change the qstr (protected by d_lock).
1951 */
Nick Piggin31e6b012011-01-07 17:49:52 +11001952 tlen = dentry->d_name.len;
1953 tname = dentry->d_name.name;
Nick Pigginfb045ad2011-01-07 17:49:55 +11001954 if (parent->d_flags & DCACHE_OP_COMPARE) {
Nick Piggin621e1552011-01-07 17:49:27 +11001955 if (parent->d_op->d_compare(parent, parent->d_inode,
1956 dentry, dentry->d_inode,
Nick Piggin31e6b012011-01-07 17:49:52 +11001957 tlen, tname, name))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001958 goto next;
1959 } else {
Nick Piggin9d55c362011-01-07 17:50:09 +11001960 if (dentry_cmp(tname, tlen, str, len))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001961 goto next;
1962 }
1963
Nick Pigginb7ab39f2011-01-07 17:49:32 +11001964 dentry->d_count++;
Linus Torvaldsd0185c02008-09-29 07:42:57 -07001965 found = dentry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001966 spin_unlock(&dentry->d_lock);
1967 break;
1968next:
1969 spin_unlock(&dentry->d_lock);
1970 }
1971 rcu_read_unlock();
1972
1973 return found;
1974}
1975
1976/**
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08001977 * d_hash_and_lookup - hash the qstr then search for a dentry
1978 * @dir: Directory to search in
1979 * @name: qstr of name we wish to find
1980 *
1981 * On hash failure or on lookup failure NULL is returned.
1982 */
1983struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name)
1984{
1985 struct dentry *dentry = NULL;
1986
1987 /*
1988 * Check for a fs-specific hash function. Note that we must
1989 * calculate the standard hash first, as the d_op->d_hash()
1990 * routine may choose to leave the hash value unchanged.
1991 */
1992 name->hash = full_name_hash(name->name, name->len);
Nick Pigginfb045ad2011-01-07 17:49:55 +11001993 if (dir->d_flags & DCACHE_OP_HASH) {
Nick Pigginb1e6a012011-01-07 17:49:28 +11001994 if (dir->d_op->d_hash(dir, dir->d_inode, name) < 0)
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08001995 goto out;
1996 }
1997 dentry = d_lookup(dir, name);
1998out:
1999 return dentry;
2000}
2001
2002/**
Nick Piggin786a5e12011-01-07 17:49:16 +11002003 * d_validate - verify dentry provided from insecure source (deprecated)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002004 * @dentry: The dentry alleged to be valid child of @dparent
Randy Dunlapff5fdb62011-01-22 20:16:06 -08002005 * @dparent: The parent dentry (known to be valid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002006 *
2007 * An insecure source has sent us a dentry, here we verify it and dget() it.
2008 * This is used by ncpfs in its readdir implementation.
2009 * Zero is returned in the dentry is invalid.
Nick Piggin786a5e12011-01-07 17:49:16 +11002010 *
2011 * This function is slow for big directories, and deprecated, do not use it.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002012 */
Nick Piggind3a23e12011-01-05 20:01:21 +11002013int d_validate(struct dentry *dentry, struct dentry *dparent)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002014{
Nick Piggin786a5e12011-01-07 17:49:16 +11002015 struct dentry *child;
Nick Piggind3a23e12011-01-05 20:01:21 +11002016
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002017 spin_lock(&dparent->d_lock);
Nick Piggin786a5e12011-01-07 17:49:16 +11002018 list_for_each_entry(child, &dparent->d_subdirs, d_u.d_child) {
2019 if (dentry == child) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002020 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Nick Piggindc0474b2011-01-07 17:49:43 +11002021 __dget_dlock(dentry);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002022 spin_unlock(&dentry->d_lock);
2023 spin_unlock(&dparent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002024 return 1;
2025 }
2026 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002027 spin_unlock(&dparent->d_lock);
Nick Piggin786a5e12011-01-07 17:49:16 +11002028
Linus Torvalds1da177e2005-04-16 15:20:36 -07002029 return 0;
2030}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002031EXPORT_SYMBOL(d_validate);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002032
2033/*
2034 * When a file is deleted, we have two options:
2035 * - turn this dentry into a negative dentry
2036 * - unhash this dentry and free it.
2037 *
2038 * Usually, we want to just turn this into
2039 * a negative dentry, but if anybody else is
2040 * currently using the dentry or the inode
2041 * we can't do that and we fall back on removing
2042 * it from the hash queues and waiting for
2043 * it to be deleted later when it has no users
2044 */
2045
2046/**
2047 * d_delete - delete a dentry
2048 * @dentry: The dentry to delete
2049 *
2050 * Turn the dentry into a negative dentry if possible, otherwise
2051 * remove it from the hash queues so it can be deleted later
2052 */
2053
2054void d_delete(struct dentry * dentry)
2055{
Nick Piggin873feea2011-01-07 17:50:06 +11002056 struct inode *inode;
John McCutchan7a91bf72005-08-08 13:52:16 -04002057 int isdir = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002058 /*
2059 * Are we the only user?
2060 */
Nick Piggin357f8e62011-01-07 17:49:42 +11002061again:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002062 spin_lock(&dentry->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11002063 inode = dentry->d_inode;
2064 isdir = S_ISDIR(inode->i_mode);
Nick Pigginb7ab39f2011-01-07 17:49:32 +11002065 if (dentry->d_count == 1) {
Nick Piggin873feea2011-01-07 17:50:06 +11002066 if (inode && !spin_trylock(&inode->i_lock)) {
Nick Piggin357f8e62011-01-07 17:49:42 +11002067 spin_unlock(&dentry->d_lock);
2068 cpu_relax();
2069 goto again;
2070 }
Al Viro13e3c5e2010-05-21 16:11:04 -04002071 dentry->d_flags &= ~DCACHE_CANT_MOUNT;
Nick Piggin31e6b012011-01-07 17:49:52 +11002072 dentry_unlink_inode(dentry);
John McCutchan7a91bf72005-08-08 13:52:16 -04002073 fsnotify_nameremove(dentry, isdir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002074 return;
2075 }
2076
2077 if (!d_unhashed(dentry))
2078 __d_drop(dentry);
2079
2080 spin_unlock(&dentry->d_lock);
John McCutchan7a91bf72005-08-08 13:52:16 -04002081
2082 fsnotify_nameremove(dentry, isdir);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002083}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002084EXPORT_SYMBOL(d_delete);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002085
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002086static void __d_rehash(struct dentry * entry, struct dcache_hash_bucket *b)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002087{
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002088 BUG_ON(!d_unhashed(entry));
2089 spin_lock_bucket(b);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002090 entry->d_flags &= ~DCACHE_UNHASHED;
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002091 hlist_bl_add_head_rcu(&entry->d_hash, &b->head);
2092 spin_unlock_bucket(b);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002093}
2094
David Howells770bfad2006-08-22 20:06:07 -04002095static void _d_rehash(struct dentry * entry)
2096{
2097 __d_rehash(entry, d_hash(entry->d_parent, entry->d_name.hash));
2098}
2099
Linus Torvalds1da177e2005-04-16 15:20:36 -07002100/**
2101 * d_rehash - add an entry back to the hash
2102 * @entry: dentry to add to the hash
2103 *
2104 * Adds a dentry to the hash according to its name.
2105 */
2106
2107void d_rehash(struct dentry * entry)
2108{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002109 spin_lock(&entry->d_lock);
David Howells770bfad2006-08-22 20:06:07 -04002110 _d_rehash(entry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002111 spin_unlock(&entry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002112}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002113EXPORT_SYMBOL(d_rehash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002114
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002115/**
2116 * dentry_update_name_case - update case insensitive dentry with a new name
2117 * @dentry: dentry to be updated
2118 * @name: new name
2119 *
2120 * Update a case insensitive dentry with new case of name.
2121 *
2122 * dentry must have been returned by d_lookup with name @name. Old and new
2123 * name lengths must match (ie. no d_compare which allows mismatched name
2124 * lengths).
2125 *
2126 * Parent inode i_mutex must be held over d_lookup and into this call (to
2127 * keep renames and concurrent inserts, and readdir(2) away).
2128 */
2129void dentry_update_name_case(struct dentry *dentry, struct qstr *name)
2130{
2131 BUG_ON(!mutex_is_locked(&dentry->d_inode->i_mutex));
2132 BUG_ON(dentry->d_name.len != name->len); /* d_lookup gives this */
2133
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002134 spin_lock(&dentry->d_lock);
Nick Piggin31e6b012011-01-07 17:49:52 +11002135 write_seqcount_begin(&dentry->d_seq);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002136 memcpy((unsigned char *)dentry->d_name.name, name->name, name->len);
Nick Piggin31e6b012011-01-07 17:49:52 +11002137 write_seqcount_end(&dentry->d_seq);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002138 spin_unlock(&dentry->d_lock);
Nick Pigginfb2d5b82011-01-07 17:49:26 +11002139}
2140EXPORT_SYMBOL(dentry_update_name_case);
2141
Linus Torvalds1da177e2005-04-16 15:20:36 -07002142static void switch_names(struct dentry *dentry, struct dentry *target)
2143{
2144 if (dname_external(target)) {
2145 if (dname_external(dentry)) {
2146 /*
2147 * Both external: swap the pointers
2148 */
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002149 swap(target->d_name.name, dentry->d_name.name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002150 } else {
2151 /*
2152 * dentry:internal, target:external. Steal target's
2153 * storage and make target internal.
2154 */
J. Bruce Fields321bcf92007-10-21 16:41:38 -07002155 memcpy(target->d_iname, dentry->d_name.name,
2156 dentry->d_name.len + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002157 dentry->d_name.name = target->d_name.name;
2158 target->d_name.name = target->d_iname;
2159 }
2160 } else {
2161 if (dname_external(dentry)) {
2162 /*
2163 * dentry:external, target:internal. Give dentry's
2164 * storage to target and make dentry internal
2165 */
2166 memcpy(dentry->d_iname, target->d_name.name,
2167 target->d_name.len + 1);
2168 target->d_name.name = dentry->d_name.name;
2169 dentry->d_name.name = dentry->d_iname;
2170 } else {
2171 /*
2172 * Both are internal. Just copy target to dentry
2173 */
2174 memcpy(dentry->d_iname, target->d_name.name,
2175 target->d_name.len + 1);
Al Virodc711ca2008-11-03 15:03:50 -05002176 dentry->d_name.len = target->d_name.len;
2177 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002178 }
2179 }
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002180 swap(dentry->d_name.len, target->d_name.len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002181}
2182
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002183static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
2184{
2185 /*
2186 * XXXX: do we really need to take target->d_lock?
2187 */
2188 if (IS_ROOT(dentry) || dentry->d_parent == target->d_parent)
2189 spin_lock(&target->d_parent->d_lock);
2190 else {
2191 if (d_ancestor(dentry->d_parent, target->d_parent)) {
2192 spin_lock(&dentry->d_parent->d_lock);
2193 spin_lock_nested(&target->d_parent->d_lock,
2194 DENTRY_D_LOCK_NESTED);
2195 } else {
2196 spin_lock(&target->d_parent->d_lock);
2197 spin_lock_nested(&dentry->d_parent->d_lock,
2198 DENTRY_D_LOCK_NESTED);
2199 }
2200 }
2201 if (target < dentry) {
2202 spin_lock_nested(&target->d_lock, 2);
2203 spin_lock_nested(&dentry->d_lock, 3);
2204 } else {
2205 spin_lock_nested(&dentry->d_lock, 2);
2206 spin_lock_nested(&target->d_lock, 3);
2207 }
2208}
2209
2210static void dentry_unlock_parents_for_move(struct dentry *dentry,
2211 struct dentry *target)
2212{
2213 if (target->d_parent != dentry->d_parent)
2214 spin_unlock(&dentry->d_parent->d_lock);
2215 if (target->d_parent != target)
2216 spin_unlock(&target->d_parent->d_lock);
2217}
2218
Linus Torvalds1da177e2005-04-16 15:20:36 -07002219/*
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002220 * When switching names, the actual string doesn't strictly have to
2221 * be preserved in the target - because we're dropping the target
2222 * anyway. As such, we can just do a simple memcpy() to copy over
2223 * the new name before we switch.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002224 *
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002225 * Note that we have to be a lot more careful about getting the hash
2226 * switched - we have to switch the hash value properly even if it
2227 * then no longer matches the actual (corrupted) string of the target.
2228 * The hash value has to match the hash queue that the dentry is on..
Linus Torvalds1da177e2005-04-16 15:20:36 -07002229 */
Trond Myklebust9eaef272006-10-21 10:24:20 -07002230/*
Nick Pigginb5c84bf2011-01-07 17:49:38 +11002231 * d_move - move a dentry
Linus Torvalds1da177e2005-04-16 15:20:36 -07002232 * @dentry: entry to move
2233 * @target: new dentry
2234 *
2235 * Update the dcache to reflect the move of a file name. Negative
2236 * dcache entries should not be moved in this way.
2237 */
Nick Pigginb5c84bf2011-01-07 17:49:38 +11002238void d_move(struct dentry * dentry, struct dentry * target)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002239{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002240 if (!dentry->d_inode)
2241 printk(KERN_WARNING "VFS: moving negative dcache entry\n");
2242
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002243 BUG_ON(d_ancestor(dentry, target));
2244 BUG_ON(d_ancestor(target, dentry));
2245
Linus Torvalds1da177e2005-04-16 15:20:36 -07002246 write_seqlock(&rename_lock);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002247
2248 dentry_lock_for_move(dentry, target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002249
Nick Piggin31e6b012011-01-07 17:49:52 +11002250 write_seqcount_begin(&dentry->d_seq);
2251 write_seqcount_begin(&target->d_seq);
2252
Nick Pigginceb5bdc2011-01-07 17:50:05 +11002253 /* __d_drop does write_seqcount_barrier, but they're OK to nest. */
2254
2255 /*
2256 * Move the dentry to the target hash queue. Don't bother checking
2257 * for the same hash queue because of how unlikely it is.
2258 */
2259 __d_drop(dentry);
Nick Piggin789680d2011-01-07 17:49:30 +11002260 __d_rehash(dentry, d_hash(target->d_parent, target->d_name.hash));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002261
2262 /* Unhash the target: dput() will then get rid of it */
2263 __d_drop(target);
2264
Eric Dumazet5160ee62006-01-08 01:03:32 -08002265 list_del(&dentry->d_u.d_child);
2266 list_del(&target->d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002267
2268 /* Switch the names.. */
2269 switch_names(dentry, target);
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002270 swap(dentry->d_name.hash, target->d_name.hash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002271
2272 /* ... and switch the parents */
2273 if (IS_ROOT(dentry)) {
2274 dentry->d_parent = target->d_parent;
2275 target->d_parent = target;
Eric Dumazet5160ee62006-01-08 01:03:32 -08002276 INIT_LIST_HEAD(&target->d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002277 } else {
Wu Fengguang9a8d5bb2009-01-07 18:09:14 -08002278 swap(dentry->d_parent, target->d_parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002279
2280 /* And add them back to the (new) parent lists */
Eric Dumazet5160ee62006-01-08 01:03:32 -08002281 list_add(&target->d_u.d_child, &target->d_parent->d_subdirs);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002282 }
2283
Eric Dumazet5160ee62006-01-08 01:03:32 -08002284 list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002285
Nick Piggin31e6b012011-01-07 17:49:52 +11002286 write_seqcount_end(&target->d_seq);
2287 write_seqcount_end(&dentry->d_seq);
2288
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002289 dentry_unlock_parents_for_move(dentry, target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002290 spin_unlock(&target->d_lock);
Nick Pigginc32ccd82006-03-25 03:07:09 -08002291 fsnotify_d_move(dentry);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002292 spin_unlock(&dentry->d_lock);
2293 write_sequnlock(&rename_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002294}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002295EXPORT_SYMBOL(d_move);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002296
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002297/**
2298 * d_ancestor - search for an ancestor
2299 * @p1: ancestor dentry
2300 * @p2: child dentry
2301 *
2302 * Returns the ancestor dentry of p2 which is a child of p1, if p1 is
2303 * an ancestor of p2, else NULL.
Trond Myklebust9eaef272006-10-21 10:24:20 -07002304 */
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002305struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2)
Trond Myklebust9eaef272006-10-21 10:24:20 -07002306{
2307 struct dentry *p;
2308
OGAWA Hirofumi871c0062008-10-16 07:50:27 +09002309 for (p = p2; !IS_ROOT(p); p = p->d_parent) {
Trond Myklebust9eaef272006-10-21 10:24:20 -07002310 if (p->d_parent == p1)
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002311 return p;
Trond Myklebust9eaef272006-10-21 10:24:20 -07002312 }
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002313 return NULL;
Trond Myklebust9eaef272006-10-21 10:24:20 -07002314}
2315
2316/*
2317 * This helper attempts to cope with remotely renamed directories
2318 *
2319 * It assumes that the caller is already holding
Nick Piggin873feea2011-01-07 17:50:06 +11002320 * dentry->d_parent->d_inode->i_mutex and the inode->i_lock
Trond Myklebust9eaef272006-10-21 10:24:20 -07002321 *
2322 * Note: If ever the locking in lock_rename() changes, then please
2323 * remember to update this too...
Trond Myklebust9eaef272006-10-21 10:24:20 -07002324 */
Nick Piggin873feea2011-01-07 17:50:06 +11002325static struct dentry *__d_unalias(struct inode *inode,
2326 struct dentry *dentry, struct dentry *alias)
Trond Myklebust9eaef272006-10-21 10:24:20 -07002327{
2328 struct mutex *m1 = NULL, *m2 = NULL;
2329 struct dentry *ret;
2330
2331 /* If alias and dentry share a parent, then no extra locks required */
2332 if (alias->d_parent == dentry->d_parent)
2333 goto out_unalias;
2334
2335 /* Check for loops */
2336 ret = ERR_PTR(-ELOOP);
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002337 if (d_ancestor(alias, dentry))
Trond Myklebust9eaef272006-10-21 10:24:20 -07002338 goto out_err;
2339
2340 /* See lock_rename() */
2341 ret = ERR_PTR(-EBUSY);
2342 if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex))
2343 goto out_err;
2344 m1 = &dentry->d_sb->s_vfs_rename_mutex;
2345 if (!mutex_trylock(&alias->d_parent->d_inode->i_mutex))
2346 goto out_err;
2347 m2 = &alias->d_parent->d_inode->i_mutex;
2348out_unalias:
Nick Pigginb5c84bf2011-01-07 17:49:38 +11002349 d_move(alias, dentry);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002350 ret = alias;
2351out_err:
Nick Piggin873feea2011-01-07 17:50:06 +11002352 spin_unlock(&inode->i_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002353 if (m2)
2354 mutex_unlock(m2);
2355 if (m1)
2356 mutex_unlock(m1);
2357 return ret;
2358}
2359
2360/*
David Howells770bfad2006-08-22 20:06:07 -04002361 * Prepare an anonymous dentry for life in the superblock's dentry tree as a
2362 * named dentry in place of the dentry to be replaced.
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002363 * returns with anon->d_lock held!
David Howells770bfad2006-08-22 20:06:07 -04002364 */
2365static void __d_materialise_dentry(struct dentry *dentry, struct dentry *anon)
2366{
2367 struct dentry *dparent, *aparent;
2368
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002369 dentry_lock_for_move(anon, dentry);
David Howells770bfad2006-08-22 20:06:07 -04002370
Nick Piggin31e6b012011-01-07 17:49:52 +11002371 write_seqcount_begin(&dentry->d_seq);
2372 write_seqcount_begin(&anon->d_seq);
2373
David Howells770bfad2006-08-22 20:06:07 -04002374 dparent = dentry->d_parent;
2375 aparent = anon->d_parent;
2376
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002377 switch_names(dentry, anon);
2378 swap(dentry->d_name.hash, anon->d_name.hash);
2379
David Howells770bfad2006-08-22 20:06:07 -04002380 dentry->d_parent = (aparent == anon) ? dentry : aparent;
2381 list_del(&dentry->d_u.d_child);
2382 if (!IS_ROOT(dentry))
2383 list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
2384 else
2385 INIT_LIST_HEAD(&dentry->d_u.d_child);
2386
2387 anon->d_parent = (dparent == dentry) ? anon : dparent;
2388 list_del(&anon->d_u.d_child);
2389 if (!IS_ROOT(anon))
2390 list_add(&anon->d_u.d_child, &anon->d_parent->d_subdirs);
2391 else
2392 INIT_LIST_HEAD(&anon->d_u.d_child);
2393
Nick Piggin31e6b012011-01-07 17:49:52 +11002394 write_seqcount_end(&dentry->d_seq);
2395 write_seqcount_end(&anon->d_seq);
2396
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002397 dentry_unlock_parents_for_move(anon, dentry);
2398 spin_unlock(&dentry->d_lock);
2399
2400 /* anon->d_lock still locked, returns locked */
David Howells770bfad2006-08-22 20:06:07 -04002401 anon->d_flags &= ~DCACHE_DISCONNECTED;
2402}
2403
2404/**
2405 * d_materialise_unique - introduce an inode into the tree
2406 * @dentry: candidate dentry
2407 * @inode: inode to bind to the dentry, to which aliases may be attached
2408 *
2409 * Introduces an dentry into the tree, substituting an extant disconnected
2410 * root directory alias in its place if there is one
2411 */
2412struct dentry *d_materialise_unique(struct dentry *dentry, struct inode *inode)
2413{
Trond Myklebust9eaef272006-10-21 10:24:20 -07002414 struct dentry *actual;
David Howells770bfad2006-08-22 20:06:07 -04002415
2416 BUG_ON(!d_unhashed(dentry));
2417
David Howells770bfad2006-08-22 20:06:07 -04002418 if (!inode) {
2419 actual = dentry;
OGAWA Hirofumi360da902008-10-16 07:50:28 +09002420 __d_instantiate(dentry, NULL);
Nick Piggin357f8e62011-01-07 17:49:42 +11002421 d_rehash(actual);
2422 goto out_nolock;
David Howells770bfad2006-08-22 20:06:07 -04002423 }
2424
Nick Piggin873feea2011-01-07 17:50:06 +11002425 spin_lock(&inode->i_lock);
Nick Piggin357f8e62011-01-07 17:49:42 +11002426
Trond Myklebust9eaef272006-10-21 10:24:20 -07002427 if (S_ISDIR(inode->i_mode)) {
2428 struct dentry *alias;
David Howells770bfad2006-08-22 20:06:07 -04002429
Trond Myklebust9eaef272006-10-21 10:24:20 -07002430 /* Does an aliased dentry already exist? */
2431 alias = __d_find_alias(inode, 0);
2432 if (alias) {
2433 actual = alias;
2434 /* Is this an anonymous mountpoint that we could splice
2435 * into our tree? */
2436 if (IS_ROOT(alias)) {
Trond Myklebust9eaef272006-10-21 10:24:20 -07002437 __d_materialise_dentry(dentry, alias);
2438 __d_drop(alias);
2439 goto found;
2440 }
2441 /* Nope, but we must(!) avoid directory aliasing */
Nick Piggin873feea2011-01-07 17:50:06 +11002442 actual = __d_unalias(inode, dentry, alias);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002443 if (IS_ERR(actual))
2444 dput(alias);
2445 goto out_nolock;
2446 }
David Howells770bfad2006-08-22 20:06:07 -04002447 }
2448
2449 /* Add a unique reference */
2450 actual = __d_instantiate_unique(dentry, inode);
2451 if (!actual)
2452 actual = dentry;
Nick Piggin357f8e62011-01-07 17:49:42 +11002453 else
2454 BUG_ON(!d_unhashed(actual));
David Howells770bfad2006-08-22 20:06:07 -04002455
David Howells770bfad2006-08-22 20:06:07 -04002456 spin_lock(&actual->d_lock);
2457found:
2458 _d_rehash(actual);
2459 spin_unlock(&actual->d_lock);
Nick Piggin873feea2011-01-07 17:50:06 +11002460 spin_unlock(&inode->i_lock);
Trond Myklebust9eaef272006-10-21 10:24:20 -07002461out_nolock:
David Howells770bfad2006-08-22 20:06:07 -04002462 if (actual == dentry) {
2463 security_d_instantiate(dentry, inode);
2464 return NULL;
2465 }
2466
2467 iput(inode);
2468 return actual;
David Howells770bfad2006-08-22 20:06:07 -04002469}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002470EXPORT_SYMBOL_GPL(d_materialise_unique);
David Howells770bfad2006-08-22 20:06:07 -04002471
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002472static int prepend(char **buffer, int *buflen, const char *str, int namelen)
Ram Pai6092d042008-03-27 13:06:20 +01002473{
2474 *buflen -= namelen;
2475 if (*buflen < 0)
2476 return -ENAMETOOLONG;
2477 *buffer -= namelen;
2478 memcpy(*buffer, str, namelen);
2479 return 0;
2480}
2481
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002482static int prepend_name(char **buffer, int *buflen, struct qstr *name)
2483{
2484 return prepend(buffer, buflen, name->name, name->len);
2485}
2486
Linus Torvalds1da177e2005-04-16 15:20:36 -07002487/**
Randy Dunlap208898c2010-11-18 15:02:49 -08002488 * prepend_path - Prepend path string to a buffer
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002489 * @path: the dentry/vfsmount to report
2490 * @root: root vfsmnt/dentry (may be modified by this function)
2491 * @buffer: pointer to the end of the buffer
2492 * @buflen: pointer to buffer length
2493 *
Nick Piggin949854d2011-01-07 17:49:37 +11002494 * Caller holds the rename_lock.
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002495 *
2496 * If path is not reachable from the supplied root, then the value of
2497 * root is changed (without modifying refcounts).
2498 */
2499static int prepend_path(const struct path *path, struct path *root,
2500 char **buffer, int *buflen)
2501{
2502 struct dentry *dentry = path->dentry;
2503 struct vfsmount *vfsmnt = path->mnt;
2504 bool slash = false;
2505 int error = 0;
2506
Nick Piggin99b7db72010-08-18 04:37:39 +10002507 br_read_lock(vfsmount_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002508 while (dentry != root->dentry || vfsmnt != root->mnt) {
2509 struct dentry * parent;
2510
2511 if (dentry == vfsmnt->mnt_root || IS_ROOT(dentry)) {
2512 /* Global root? */
2513 if (vfsmnt->mnt_parent == vfsmnt) {
2514 goto global_root;
2515 }
2516 dentry = vfsmnt->mnt_mountpoint;
2517 vfsmnt = vfsmnt->mnt_parent;
2518 continue;
2519 }
2520 parent = dentry->d_parent;
2521 prefetch(parent);
Nick Piggin9abca362011-01-07 17:49:36 +11002522 spin_lock(&dentry->d_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002523 error = prepend_name(buffer, buflen, &dentry->d_name);
Nick Piggin9abca362011-01-07 17:49:36 +11002524 spin_unlock(&dentry->d_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002525 if (!error)
2526 error = prepend(buffer, buflen, "/", 1);
2527 if (error)
2528 break;
2529
2530 slash = true;
2531 dentry = parent;
2532 }
2533
2534out:
2535 if (!error && !slash)
2536 error = prepend(buffer, buflen, "/", 1);
2537
Nick Piggin99b7db72010-08-18 04:37:39 +10002538 br_read_unlock(vfsmount_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002539 return error;
2540
2541global_root:
2542 /*
2543 * Filesystems needing to implement special "root names"
2544 * should do so with ->d_dname()
2545 */
2546 if (IS_ROOT(dentry) &&
2547 (dentry->d_name.len != 1 || dentry->d_name.name[0] != '/')) {
2548 WARN(1, "Root dentry has weird name <%.*s>\n",
2549 (int) dentry->d_name.len, dentry->d_name.name);
2550 }
2551 root->mnt = vfsmnt;
2552 root->dentry = dentry;
2553 goto out;
2554}
2555
2556/**
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +02002557 * __d_path - return the path of a dentry
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002558 * @path: the dentry/vfsmount to report
2559 * @root: root vfsmnt/dentry (may be modified by this function)
Randy Dunlapcd956a12010-08-14 13:05:31 -07002560 * @buf: buffer to return value in
Linus Torvalds1da177e2005-04-16 15:20:36 -07002561 * @buflen: buffer length
2562 *
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002563 * Convert a dentry into an ASCII path name.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002564 *
Arjan van de Ven52afeef2008-12-01 14:35:00 -08002565 * Returns a pointer into the buffer or an error code if the
2566 * path was too long.
Linus Torvalds552ce542007-02-13 12:08:18 -08002567 *
Christoph Hellwigbe148242010-10-10 05:36:21 -04002568 * "buflen" should be positive.
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002569 *
2570 * If path is not reachable from the supplied root, then the value of
2571 * root is changed (without modifying refcounts).
Linus Torvalds1da177e2005-04-16 15:20:36 -07002572 */
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002573char *__d_path(const struct path *path, struct path *root,
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002574 char *buf, int buflen)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002575{
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002576 char *res = buf + buflen;
2577 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002578
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002579 prepend(&res, &buflen, "\0", 1);
Nick Piggin949854d2011-01-07 17:49:37 +11002580 write_seqlock(&rename_lock);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002581 error = prepend_path(path, root, &res, &buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002582 write_sequnlock(&rename_lock);
Christoph Hellwigbe148242010-10-10 05:36:21 -04002583
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002584 if (error)
2585 return ERR_PTR(error);
Miklos Szeredif2eb6572010-08-10 11:41:39 +02002586 return res;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002587}
2588
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002589/*
2590 * same as __d_path but appends "(deleted)" for unlinked files.
2591 */
2592static int path_with_deleted(const struct path *path, struct path *root,
2593 char **buf, int *buflen)
2594{
2595 prepend(buf, buflen, "\0", 1);
2596 if (d_unlinked(path->dentry)) {
2597 int error = prepend(buf, buflen, " (deleted)", 10);
2598 if (error)
2599 return error;
2600 }
2601
2602 return prepend_path(path, root, buf, buflen);
2603}
2604
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002605static int prepend_unreachable(char **buffer, int *buflen)
2606{
2607 return prepend(buffer, buflen, "(unreachable)", 13);
2608}
2609
Jan Bluncka03a8a702008-02-14 19:38:32 -08002610/**
2611 * d_path - return the path of a dentry
Jan Blunckcf28b482008-02-14 19:38:44 -08002612 * @path: path to report
Jan Bluncka03a8a702008-02-14 19:38:32 -08002613 * @buf: buffer to return value in
2614 * @buflen: buffer length
2615 *
2616 * Convert a dentry into an ASCII path name. If the entry has been deleted
2617 * the string " (deleted)" is appended. Note that this is ambiguous.
2618 *
Arjan van de Ven52afeef2008-12-01 14:35:00 -08002619 * Returns a pointer into the buffer or an error code if the path was
2620 * too long. Note: Callers should use the returned pointer, not the passed
2621 * in buffer, to use the name! The implementation often starts at an offset
2622 * into the buffer, and may leave 0 bytes at the start.
Jan Bluncka03a8a702008-02-14 19:38:32 -08002623 *
Miklos Szeredi31f3e0b2008-06-23 18:11:52 +02002624 * "buflen" should be positive.
Jan Bluncka03a8a702008-02-14 19:38:32 -08002625 */
Jan Engelhardt20d4fdc2008-06-09 16:40:36 -07002626char *d_path(const struct path *path, char *buf, int buflen)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002627{
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002628 char *res = buf + buflen;
Jan Blunck6ac08c32008-02-14 19:34:38 -08002629 struct path root;
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002630 struct path tmp;
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002631 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002632
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002633 /*
2634 * We have various synthetic filesystems that never get mounted. On
2635 * these filesystems dentries are never used for lookup purposes, and
2636 * thus don't need to be hashed. They also don't need a name until a
2637 * user wants to identify the object in /proc/pid/fd/. The little hack
2638 * below allows us to generate a name for these objects on demand:
2639 */
Jan Blunckcf28b482008-02-14 19:38:44 -08002640 if (path->dentry->d_op && path->dentry->d_op->d_dname)
2641 return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002642
Miklos Szeredif7ad3c62010-08-10 11:41:36 +02002643 get_fs_root(current->fs, &root);
Nick Piggin949854d2011-01-07 17:49:37 +11002644 write_seqlock(&rename_lock);
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002645 tmp = root;
Miklos Szerediffd1f4e2010-08-10 11:41:40 +02002646 error = path_with_deleted(path, &tmp, &res, &buflen);
2647 if (error)
2648 res = ERR_PTR(error);
Nick Piggin949854d2011-01-07 17:49:37 +11002649 write_sequnlock(&rename_lock);
Jan Blunck6ac08c32008-02-14 19:34:38 -08002650 path_put(&root);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002651 return res;
2652}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07002653EXPORT_SYMBOL(d_path);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002654
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002655/**
2656 * d_path_with_unreachable - return the path of a dentry
2657 * @path: path to report
2658 * @buf: buffer to return value in
2659 * @buflen: buffer length
2660 *
2661 * The difference from d_path() is that this prepends "(unreachable)"
2662 * to paths which are unreachable from the current process' root.
2663 */
2664char *d_path_with_unreachable(const struct path *path, char *buf, int buflen)
2665{
2666 char *res = buf + buflen;
2667 struct path root;
2668 struct path tmp;
2669 int error;
2670
2671 if (path->dentry->d_op && path->dentry->d_op->d_dname)
2672 return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
2673
2674 get_fs_root(current->fs, &root);
Nick Piggin949854d2011-01-07 17:49:37 +11002675 write_seqlock(&rename_lock);
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002676 tmp = root;
2677 error = path_with_deleted(path, &tmp, &res, &buflen);
2678 if (!error && !path_equal(&tmp, &root))
2679 error = prepend_unreachable(&res, &buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002680 write_sequnlock(&rename_lock);
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002681 path_put(&root);
2682 if (error)
2683 res = ERR_PTR(error);
2684
2685 return res;
2686}
2687
Linus Torvalds1da177e2005-04-16 15:20:36 -07002688/*
Eric Dumazetc23fbb62007-05-08 00:26:18 -07002689 * Helper function for dentry_operations.d_dname() members
2690 */
2691char *dynamic_dname(struct dentry *dentry, char *buffer, int buflen,
2692 const char *fmt, ...)
2693{
2694 va_list args;
2695 char temp[64];
2696 int sz;
2697
2698 va_start(args, fmt);
2699 sz = vsnprintf(temp, sizeof(temp), fmt, args) + 1;
2700 va_end(args);
2701
2702 if (sz > sizeof(temp) || sz > buflen)
2703 return ERR_PTR(-ENAMETOOLONG);
2704
2705 buffer += buflen - sz;
2706 return memcpy(buffer, temp, sz);
2707}
2708
2709/*
Ram Pai6092d042008-03-27 13:06:20 +01002710 * Write full pathname from the root of the filesystem into the buffer.
2711 */
Nick Pigginec2447c2011-01-07 17:49:29 +11002712static char *__dentry_path(struct dentry *dentry, char *buf, int buflen)
Ram Pai6092d042008-03-27 13:06:20 +01002713{
2714 char *end = buf + buflen;
2715 char *retval;
2716
Ram Pai6092d042008-03-27 13:06:20 +01002717 prepend(&end, &buflen, "\0", 1);
Ram Pai6092d042008-03-27 13:06:20 +01002718 if (buflen < 1)
2719 goto Elong;
2720 /* Get '/' right */
2721 retval = end-1;
2722 *retval = '/';
2723
Miklos Szeredicdd16d02008-06-23 18:11:53 +02002724 while (!IS_ROOT(dentry)) {
2725 struct dentry *parent = dentry->d_parent;
Nick Piggin9abca362011-01-07 17:49:36 +11002726 int error;
Ram Pai6092d042008-03-27 13:06:20 +01002727
Ram Pai6092d042008-03-27 13:06:20 +01002728 prefetch(parent);
Nick Piggin9abca362011-01-07 17:49:36 +11002729 spin_lock(&dentry->d_lock);
2730 error = prepend_name(&end, &buflen, &dentry->d_name);
2731 spin_unlock(&dentry->d_lock);
2732 if (error != 0 || prepend(&end, &buflen, "/", 1) != 0)
Ram Pai6092d042008-03-27 13:06:20 +01002733 goto Elong;
2734
2735 retval = end;
2736 dentry = parent;
2737 }
Al Viroc1031352010-06-06 22:31:14 -04002738 return retval;
2739Elong:
2740 return ERR_PTR(-ENAMETOOLONG);
2741}
Nick Pigginec2447c2011-01-07 17:49:29 +11002742
2743char *dentry_path_raw(struct dentry *dentry, char *buf, int buflen)
2744{
2745 char *retval;
2746
Nick Piggin949854d2011-01-07 17:49:37 +11002747 write_seqlock(&rename_lock);
Nick Pigginec2447c2011-01-07 17:49:29 +11002748 retval = __dentry_path(dentry, buf, buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002749 write_sequnlock(&rename_lock);
Nick Pigginec2447c2011-01-07 17:49:29 +11002750
2751 return retval;
2752}
2753EXPORT_SYMBOL(dentry_path_raw);
Al Viroc1031352010-06-06 22:31:14 -04002754
2755char *dentry_path(struct dentry *dentry, char *buf, int buflen)
2756{
2757 char *p = NULL;
2758 char *retval;
2759
Nick Piggin949854d2011-01-07 17:49:37 +11002760 write_seqlock(&rename_lock);
Al Viroc1031352010-06-06 22:31:14 -04002761 if (d_unlinked(dentry)) {
2762 p = buf + buflen;
2763 if (prepend(&p, &buflen, "//deleted", 10) != 0)
2764 goto Elong;
2765 buflen++;
2766 }
2767 retval = __dentry_path(dentry, buf, buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002768 write_sequnlock(&rename_lock);
Al Viroc1031352010-06-06 22:31:14 -04002769 if (!IS_ERR(retval) && p)
2770 *p = '/'; /* restore '/' overriden with '\0' */
Ram Pai6092d042008-03-27 13:06:20 +01002771 return retval;
2772Elong:
Ram Pai6092d042008-03-27 13:06:20 +01002773 return ERR_PTR(-ENAMETOOLONG);
2774}
2775
2776/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002777 * NOTE! The user-level library version returns a
2778 * character pointer. The kernel system call just
2779 * returns the length of the buffer filled (which
2780 * includes the ending '\0' character), or a negative
2781 * error value. So libc would do something like
2782 *
2783 * char *getcwd(char * buf, size_t size)
2784 * {
2785 * int retval;
2786 *
2787 * retval = sys_getcwd(buf, size);
2788 * if (retval >= 0)
2789 * return buf;
2790 * errno = -retval;
2791 * return NULL;
2792 * }
2793 */
Heiko Carstens3cdad422009-01-14 14:14:22 +01002794SYSCALL_DEFINE2(getcwd, char __user *, buf, unsigned long, size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002795{
Linus Torvalds552ce542007-02-13 12:08:18 -08002796 int error;
Jan Blunck6ac08c32008-02-14 19:34:38 -08002797 struct path pwd, root;
Linus Torvalds552ce542007-02-13 12:08:18 -08002798 char *page = (char *) __get_free_page(GFP_USER);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002799
2800 if (!page)
2801 return -ENOMEM;
2802
Miklos Szeredif7ad3c62010-08-10 11:41:36 +02002803 get_fs_root_and_pwd(current->fs, &root, &pwd);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002804
Linus Torvalds552ce542007-02-13 12:08:18 -08002805 error = -ENOENT;
Nick Piggin949854d2011-01-07 17:49:37 +11002806 write_seqlock(&rename_lock);
Alexey Dobriyanf3da3922009-05-04 03:32:03 +04002807 if (!d_unlinked(pwd.dentry)) {
Linus Torvalds552ce542007-02-13 12:08:18 -08002808 unsigned long len;
Miklos Szeredi9d1bc6012008-03-27 13:06:21 +01002809 struct path tmp = root;
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002810 char *cwd = page + PAGE_SIZE;
2811 int buflen = PAGE_SIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002812
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002813 prepend(&cwd, &buflen, "\0", 1);
2814 error = prepend_path(&pwd, &tmp, &cwd, &buflen);
Nick Piggin949854d2011-01-07 17:49:37 +11002815 write_sequnlock(&rename_lock);
Linus Torvalds552ce542007-02-13 12:08:18 -08002816
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002817 if (error)
Linus Torvalds552ce542007-02-13 12:08:18 -08002818 goto out;
2819
Miklos Szeredi8df9d1a2010-08-10 11:41:41 +02002820 /* Unreachable from current root */
2821 if (!path_equal(&tmp, &root)) {
2822 error = prepend_unreachable(&cwd, &buflen);
2823 if (error)
2824 goto out;
2825 }
2826
Linus Torvalds552ce542007-02-13 12:08:18 -08002827 error = -ERANGE;
2828 len = PAGE_SIZE + page - cwd;
2829 if (len <= size) {
2830 error = len;
2831 if (copy_to_user(buf, cwd, len))
2832 error = -EFAULT;
2833 }
Nick Piggin949854d2011-01-07 17:49:37 +11002834 } else {
2835 write_sequnlock(&rename_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002836 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002837
2838out:
Jan Blunck6ac08c32008-02-14 19:34:38 -08002839 path_put(&pwd);
2840 path_put(&root);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002841 free_page((unsigned long) page);
2842 return error;
2843}
2844
2845/*
2846 * Test whether new_dentry is a subdirectory of old_dentry.
2847 *
2848 * Trivially implemented using the dcache structure
2849 */
2850
2851/**
2852 * is_subdir - is new dentry a subdirectory of old_dentry
2853 * @new_dentry: new dentry
2854 * @old_dentry: old dentry
2855 *
2856 * Returns 1 if new_dentry is a subdirectory of the parent (at any depth).
2857 * Returns 0 otherwise.
2858 * Caller must ensure that "new_dentry" is pinned before calling is_subdir()
2859 */
2860
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002861int is_subdir(struct dentry *new_dentry, struct dentry *old_dentry)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002862{
2863 int result;
Nick Piggin949854d2011-01-07 17:49:37 +11002864 unsigned seq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002865
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002866 if (new_dentry == old_dentry)
2867 return 1;
2868
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002869 do {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002870 /* for restarting inner loop in case of seq retry */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002871 seq = read_seqbegin(&rename_lock);
Nick Piggin949854d2011-01-07 17:49:37 +11002872 /*
2873 * Need rcu_readlock to protect against the d_parent trashing
2874 * due to d_move
2875 */
2876 rcu_read_lock();
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002877 if (d_ancestor(old_dentry, new_dentry))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002878 result = 1;
OGAWA Hirofumie2761a12008-10-16 07:50:28 +09002879 else
2880 result = 0;
Nick Piggin949854d2011-01-07 17:49:37 +11002881 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002882 } while (read_seqretry(&rename_lock, seq));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002883
2884 return result;
2885}
2886
Al Viro2096f752010-01-30 13:16:21 -05002887int path_is_under(struct path *path1, struct path *path2)
2888{
2889 struct vfsmount *mnt = path1->mnt;
2890 struct dentry *dentry = path1->dentry;
2891 int res;
Nick Piggin99b7db72010-08-18 04:37:39 +10002892
2893 br_read_lock(vfsmount_lock);
Al Viro2096f752010-01-30 13:16:21 -05002894 if (mnt != path2->mnt) {
2895 for (;;) {
2896 if (mnt->mnt_parent == mnt) {
Nick Piggin99b7db72010-08-18 04:37:39 +10002897 br_read_unlock(vfsmount_lock);
Al Viro2096f752010-01-30 13:16:21 -05002898 return 0;
2899 }
2900 if (mnt->mnt_parent == path2->mnt)
2901 break;
2902 mnt = mnt->mnt_parent;
2903 }
2904 dentry = mnt->mnt_mountpoint;
2905 }
2906 res = is_subdir(dentry, path2->dentry);
Nick Piggin99b7db72010-08-18 04:37:39 +10002907 br_read_unlock(vfsmount_lock);
Al Viro2096f752010-01-30 13:16:21 -05002908 return res;
2909}
2910EXPORT_SYMBOL(path_is_under);
2911
Linus Torvalds1da177e2005-04-16 15:20:36 -07002912void d_genocide(struct dentry *root)
2913{
Nick Piggin949854d2011-01-07 17:49:37 +11002914 struct dentry *this_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002915 struct list_head *next;
Nick Piggin949854d2011-01-07 17:49:37 +11002916 unsigned seq;
Nick Piggin58db63d2011-01-07 17:49:39 +11002917 int locked = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002918
Nick Piggin949854d2011-01-07 17:49:37 +11002919 seq = read_seqbegin(&rename_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11002920again:
2921 this_parent = root;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002922 spin_lock(&this_parent->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002923repeat:
2924 next = this_parent->d_subdirs.next;
2925resume:
2926 while (next != &this_parent->d_subdirs) {
2927 struct list_head *tmp = next;
Eric Dumazet5160ee62006-01-08 01:03:32 -08002928 struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002929 next = tmp->next;
Nick Piggin949854d2011-01-07 17:49:37 +11002930
Nick Pigginda502952011-01-07 17:49:33 +11002931 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
2932 if (d_unhashed(dentry) || !dentry->d_inode) {
2933 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002934 continue;
Nick Pigginda502952011-01-07 17:49:33 +11002935 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002936 if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002937 spin_unlock(&this_parent->d_lock);
2938 spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002939 this_parent = dentry;
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002940 spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002941 goto repeat;
2942 }
Nick Piggin949854d2011-01-07 17:49:37 +11002943 if (!(dentry->d_flags & DCACHE_GENOCIDE)) {
2944 dentry->d_flags |= DCACHE_GENOCIDE;
2945 dentry->d_count--;
2946 }
Nick Pigginb7ab39f2011-01-07 17:49:32 +11002947 spin_unlock(&dentry->d_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002948 }
2949 if (this_parent != root) {
Linus Torvaldsc826cb72011-03-15 15:29:21 -07002950 struct dentry *child = this_parent;
Nick Piggin949854d2011-01-07 17:49:37 +11002951 if (!(this_parent->d_flags & DCACHE_GENOCIDE)) {
2952 this_parent->d_flags |= DCACHE_GENOCIDE;
2953 this_parent->d_count--;
2954 }
Linus Torvaldsc826cb72011-03-15 15:29:21 -07002955 this_parent = try_to_ascend(this_parent, locked, seq);
2956 if (!this_parent)
Nick Piggin949854d2011-01-07 17:49:37 +11002957 goto rename_retry;
Nick Piggin949854d2011-01-07 17:49:37 +11002958 next = child->d_u.d_child.next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002959 goto resume;
2960 }
Nick Piggin2fd6b7f2011-01-07 17:49:34 +11002961 spin_unlock(&this_parent->d_lock);
Nick Piggin58db63d2011-01-07 17:49:39 +11002962 if (!locked && read_seqretry(&rename_lock, seq))
Nick Piggin949854d2011-01-07 17:49:37 +11002963 goto rename_retry;
Nick Piggin58db63d2011-01-07 17:49:39 +11002964 if (locked)
2965 write_sequnlock(&rename_lock);
2966 return;
2967
2968rename_retry:
2969 locked = 1;
2970 write_seqlock(&rename_lock);
2971 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002972}
2973
2974/**
2975 * find_inode_number - check for dentry with name
2976 * @dir: directory to check
2977 * @name: Name to find.
2978 *
2979 * Check whether a dentry already exists for the given name,
2980 * and return the inode number if it has an inode. Otherwise
2981 * 0 is returned.
2982 *
2983 * This routine is used to post-process directory listings for
2984 * filesystems using synthetic inode numbers, and is necessary
2985 * to keep getcwd() working.
2986 */
2987
2988ino_t find_inode_number(struct dentry *dir, struct qstr *name)
2989{
2990 struct dentry * dentry;
2991 ino_t ino = 0;
2992
Eric W. Biederman3e7e2412006-03-31 02:31:43 -08002993 dentry = d_hash_and_lookup(dir, name);
2994 if (dentry) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002995 if (dentry->d_inode)
2996 ino = dentry->d_inode->i_ino;
2997 dput(dentry);
2998 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002999 return ino;
3000}
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07003001EXPORT_SYMBOL(find_inode_number);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003002
3003static __initdata unsigned long dhash_entries;
3004static int __init set_dhash_entries(char *str)
3005{
3006 if (!str)
3007 return 0;
3008 dhash_entries = simple_strtoul(str, &str, 0);
3009 return 1;
3010}
3011__setup("dhash_entries=", set_dhash_entries);
3012
3013static void __init dcache_init_early(void)
3014{
3015 int loop;
3016
3017 /* If hashes are distributed across NUMA nodes, defer
3018 * hash allocation until vmalloc space is available.
3019 */
3020 if (hashdist)
3021 return;
3022
3023 dentry_hashtable =
3024 alloc_large_system_hash("Dentry cache",
Nick Pigginceb5bdc2011-01-07 17:50:05 +11003025 sizeof(struct dcache_hash_bucket),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003026 dhash_entries,
3027 13,
3028 HASH_EARLY,
3029 &d_hash_shift,
3030 &d_hash_mask,
3031 0);
3032
3033 for (loop = 0; loop < (1 << d_hash_shift); loop++)
Nick Pigginceb5bdc2011-01-07 17:50:05 +11003034 INIT_HLIST_BL_HEAD(&dentry_hashtable[loop].head);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003035}
3036
Denis Cheng74bf17c2007-10-16 23:26:30 -07003037static void __init dcache_init(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003038{
3039 int loop;
3040
3041 /*
3042 * A constructor could be added for stable state like the lists,
3043 * but it is probably not worth it because of the cache nature
3044 * of the dcache.
3045 */
Christoph Lameter0a31bd52007-05-06 14:49:57 -07003046 dentry_cache = KMEM_CACHE(dentry,
3047 SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003048
Rusty Russell8e1f9362007-07-17 04:03:17 -07003049 register_shrinker(&dcache_shrinker);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003050
3051 /* Hash may have been set up in dcache_init_early */
3052 if (!hashdist)
3053 return;
3054
3055 dentry_hashtable =
3056 alloc_large_system_hash("Dentry cache",
Nick Pigginceb5bdc2011-01-07 17:50:05 +11003057 sizeof(struct dcache_hash_bucket),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003058 dhash_entries,
3059 13,
3060 0,
3061 &d_hash_shift,
3062 &d_hash_mask,
3063 0);
3064
3065 for (loop = 0; loop < (1 << d_hash_shift); loop++)
Nick Pigginceb5bdc2011-01-07 17:50:05 +11003066 INIT_HLIST_BL_HEAD(&dentry_hashtable[loop].head);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003067}
3068
3069/* SLAB cache for __getname() consumers */
Christoph Lametere18b8902006-12-06 20:33:20 -08003070struct kmem_cache *names_cachep __read_mostly;
H Hartley Sweetenec4f8602010-01-05 13:45:18 -07003071EXPORT_SYMBOL(names_cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003072
Linus Torvalds1da177e2005-04-16 15:20:36 -07003073EXPORT_SYMBOL(d_genocide);
3074
Linus Torvalds1da177e2005-04-16 15:20:36 -07003075void __init vfs_caches_init_early(void)
3076{
3077 dcache_init_early();
3078 inode_init_early();
3079}
3080
3081void __init vfs_caches_init(unsigned long mempages)
3082{
3083 unsigned long reserve;
3084
3085 /* Base hash sizes on available memory, with a reserve equal to
3086 150% of current kernel size */
3087
3088 reserve = min((mempages - nr_free_pages()) * 3/2, mempages - 1);
3089 mempages -= reserve;
3090
3091 names_cachep = kmem_cache_create("names_cache", PATH_MAX, 0,
Paul Mundt20c2df82007-07-20 10:11:58 +09003092 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003093
Denis Cheng74bf17c2007-10-16 23:26:30 -07003094 dcache_init();
3095 inode_init();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003096 files_init(mempages);
Denis Cheng74bf17c2007-10-16 23:26:30 -07003097 mnt_init();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003098 bdev_cache_init();
3099 chrdev_init();
3100}