dcache.c 72.4 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/*
 * fs/dcache.c
 *
 * Complete reimplementation
 * (C) 1997 Thomas Schoebel-Theuer,
 * with heavy changes by Linus Torvalds
 */

/*
 * Notes on the allocation strategy:
 *
 * The dcache is a master of the icache - whenever a dcache entry
 * exists, the inode will always exist. "iput()" is done either when
 * the dcache entry is deleted or garbage collected.
 */

#include <linux/syscalls.h>
#include <linux/string.h>
#include <linux/mm.h>
#include <linux/fs.h>
21
#include <linux/fsnotify.h>
Linus Torvalds's avatar
Linus Torvalds committed
22 23 24 25 26 27 28 29 30 31 32 33
#include <linux/slab.h>
#include <linux/init.h>
#include <linux/hash.h>
#include <linux/cache.h>
#include <linux/module.h>
#include <linux/mount.h>
#include <linux/file.h>
#include <asm/uaccess.h>
#include <linux/security.h>
#include <linux/seqlock.h>
#include <linux/swap.h>
#include <linux/bootmem.h>
34
#include <linux/fs_struct.h>
35
#include <linux/hardirq.h>
36
#include "internal.h"
Linus Torvalds's avatar
Linus Torvalds committed
37

Nick Piggin's avatar
Nick Piggin committed
38 39
/*
 * Usage:
Nick Piggin's avatar
Nick Piggin committed
40 41
 * dcache_inode_lock protects:
 *   - i_dentry, d_alias, d_inode
Nick Piggin's avatar
Nick Piggin committed
42 43 44 45 46 47 48 49
 * dcache_hash_lock protects:
 *   - the dcache hash table, s_anon lists
 * dcache_lru_lock protects:
 *   - the dcache lru lists and counters
 * d_lock protects:
 *   - d_flags
 *   - d_name
 *   - d_lru
50
 *   - d_count
Nick Piggin's avatar
Nick Piggin committed
51
 *   - d_unhashed()
Nick Piggin's avatar
Nick Piggin committed
52 53
 *   - d_parent and d_subdirs
 *   - childrens' d_child and d_parent
Nick Piggin's avatar
Nick Piggin committed
54
 *   - d_alias, d_inode
Nick Piggin's avatar
Nick Piggin committed
55 56 57
 *
 * Ordering:
 * dcache_lock
Nick Piggin's avatar
Nick Piggin committed
58 59 60 61
 *   dcache_inode_lock
 *     dentry->d_lock
 *       dcache_lru_lock
 *       dcache_hash_lock
Nick Piggin's avatar
Nick Piggin committed
62
 *
Nick Piggin's avatar
Nick Piggin committed
63 64 65 66 67 68 69
 * If there is an ancestor relationship:
 * dentry->d_parent->...->d_parent->d_lock
 *   ...
 *     dentry->d_parent->d_lock
 *       dentry->d_lock
 *
 * If no ancestor relationship:
Nick Piggin's avatar
Nick Piggin committed
70 71 72 73
 * if (dentry1 < dentry2)
 *   dentry1->d_lock
 *     dentry2->d_lock
 */
74
int sysctl_vfs_cache_pressure __read_mostly = 100;
Linus Torvalds's avatar
Linus Torvalds committed
75 76
EXPORT_SYMBOL_GPL(sysctl_vfs_cache_pressure);

Nick Piggin's avatar
Nick Piggin committed
77
__cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
78
static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_hash_lock);
Nick Piggin's avatar
Nick Piggin committed
79
static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_lru_lock);
Nick Piggin's avatar
Nick Piggin committed
80
__cacheline_aligned_in_smp DEFINE_SPINLOCK(dcache_lock);
Al Viro's avatar
Al Viro committed
81
__cacheline_aligned_in_smp DEFINE_SEQLOCK(rename_lock);
Linus Torvalds's avatar
Linus Torvalds committed
82

Nick Piggin's avatar
Nick Piggin committed
83
EXPORT_SYMBOL(dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
84 85
EXPORT_SYMBOL(dcache_lock);

86
static struct kmem_cache *dentry_cache __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
87 88 89 90 91 92 93 94 95 96 97 98 99 100

#define DNAME_INLINE_LEN (sizeof(struct dentry)-offsetof(struct dentry,d_iname))

/*
 * This is the single most critical data structure when it comes
 * to the dcache: the hashtable for lookups. Somebody should try
 * to make this good - I've just made it work.
 *
 * This hash-function tries to avoid losing too many bits of hash
 * information, yet avoid using a prime hash-size or similar.
 */
#define D_HASHBITS     d_hash_shift
#define D_HASHMASK     d_hash_mask

101 102 103
static unsigned int d_hash_mask __read_mostly;
static unsigned int d_hash_shift __read_mostly;
static struct hlist_head *dentry_hashtable __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
104 105 106 107 108 109

/* Statistics gathering. */
struct dentry_stat_t dentry_stat = {
	.age_limit = 45,
};

110
static DEFINE_PER_CPU(unsigned int, nr_dentry);
111 112

#if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
113 114 115 116 117 118 119 120 121
static int get_nr_dentry(void)
{
	int i;
	int sum = 0;
	for_each_possible_cpu(i)
		sum += per_cpu(nr_dentry, i);
	return sum < 0 ? 0 : sum;
}

122 123 124
int proc_nr_dentry(ctl_table *table, int write, void __user *buffer,
		   size_t *lenp, loff_t *ppos)
{
125
	dentry_stat.nr_dentry = get_nr_dentry();
126 127 128 129
	return proc_dointvec(table, write, buffer, lenp, ppos);
}
#endif

Christoph Hellwig's avatar
Christoph Hellwig committed
130
static void __d_free(struct rcu_head *head)
Linus Torvalds's avatar
Linus Torvalds committed
131
{
Christoph Hellwig's avatar
Christoph Hellwig committed
132 133
	struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu);

134
	WARN_ON(!list_empty(&dentry->d_alias));
Linus Torvalds's avatar
Linus Torvalds committed
135 136 137 138 139 140
	if (dname_external(dentry))
		kfree(dentry->d_name.name);
	kmem_cache_free(dentry_cache, dentry); 
}

/*
141
 * no dcache_lock, please.
Linus Torvalds's avatar
Linus Torvalds committed
142 143 144
 */
static void d_free(struct dentry *dentry)
{
145
	BUG_ON(dentry->d_count);
146
	this_cpu_dec(nr_dentry);
Linus Torvalds's avatar
Linus Torvalds committed
147 148
	if (dentry->d_op && dentry->d_op->d_release)
		dentry->d_op->d_release(dentry);
149

150
	/* if dentry was never inserted into hash, immediate free is OK */
Akinobu Mita's avatar
Akinobu Mita committed
151
	if (hlist_unhashed(&dentry->d_hash))
Christoph Hellwig's avatar
Christoph Hellwig committed
152
		__d_free(&dentry->d_u.d_rcu);
153
	else
Christoph Hellwig's avatar
Christoph Hellwig committed
154
		call_rcu(&dentry->d_u.d_rcu, __d_free);
Linus Torvalds's avatar
Linus Torvalds committed
155 156 157 158 159 160
}

/*
 * Release the dentry's inode, using the filesystem
 * d_iput() operation if defined.
 */
161
static void dentry_iput(struct dentry * dentry)
162
	__releases(dentry->d_lock)
Nick Piggin's avatar
Nick Piggin committed
163
	__releases(dcache_inode_lock)
164
	__releases(dcache_lock)
Linus Torvalds's avatar
Linus Torvalds committed
165 166 167 168 169 170
{
	struct inode *inode = dentry->d_inode;
	if (inode) {
		dentry->d_inode = NULL;
		list_del_init(&dentry->d_alias);
		spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
171
		spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
172
		spin_unlock(&dcache_lock);
173 174
		if (!inode->i_nlink)
			fsnotify_inoderemove(inode);
Linus Torvalds's avatar
Linus Torvalds committed
175 176 177 178 179 180
		if (dentry->d_op && dentry->d_op->d_iput)
			dentry->d_op->d_iput(dentry, inode);
		else
			iput(inode);
	} else {
		spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
181
		spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
182 183 184 185
		spin_unlock(&dcache_lock);
	}
}

186
/*
Nick Piggin's avatar
Nick Piggin committed
187
 * dentry_lru_(add|del|move_tail) must be called with d_lock held.
188 189 190
 */
static void dentry_lru_add(struct dentry *dentry)
{
191
	if (list_empty(&dentry->d_lru)) {
Nick Piggin's avatar
Nick Piggin committed
192
		spin_lock(&dcache_lru_lock);
193 194
		list_add(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
		dentry->d_sb->s_nr_dentry_unused++;
195
		dentry_stat.nr_unused++;
Nick Piggin's avatar
Nick Piggin committed
196
		spin_unlock(&dcache_lru_lock);
197
	}
198 199
}

Nick Piggin's avatar
Nick Piggin committed
200 201 202 203 204 205 206
static void __dentry_lru_del(struct dentry *dentry)
{
	list_del_init(&dentry->d_lru);
	dentry->d_sb->s_nr_dentry_unused--;
	dentry_stat.nr_unused--;
}

207 208 209
static void dentry_lru_del(struct dentry *dentry)
{
	if (!list_empty(&dentry->d_lru)) {
Nick Piggin's avatar
Nick Piggin committed
210 211 212
		spin_lock(&dcache_lru_lock);
		__dentry_lru_del(dentry);
		spin_unlock(&dcache_lru_lock);
213 214 215
	}
}

216
static void dentry_lru_move_tail(struct dentry *dentry)
217
{
Nick Piggin's avatar
Nick Piggin committed
218
	spin_lock(&dcache_lru_lock);
219 220 221
	if (list_empty(&dentry->d_lru)) {
		list_add_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
		dentry->d_sb->s_nr_dentry_unused++;
222
		dentry_stat.nr_unused++;
223 224
	} else {
		list_move_tail(&dentry->d_lru, &dentry->d_sb->s_dentry_lru);
225
	}
Nick Piggin's avatar
Nick Piggin committed
226
	spin_unlock(&dcache_lru_lock);
227 228
}

229 230 231 232
/**
 * d_kill - kill dentry and return parent
 * @dentry: dentry to kill
 *
233
 * The dentry must already be unhashed and removed from the LRU.
234 235
 *
 * If this is the root of the dentry tree, return NULL.
Nick Piggin's avatar
Nick Piggin committed
236
 *
Nick Piggin's avatar
Nick Piggin committed
237 238
 * dcache_lock and d_lock and d_parent->d_lock must be held by caller, and
 * are dropped by d_kill.
239
 */
Nick Piggin's avatar
Nick Piggin committed
240
static struct dentry *d_kill(struct dentry *dentry, struct dentry *parent)
241
	__releases(dentry->d_lock)
Nick Piggin's avatar
Nick Piggin committed
242
	__releases(parent->d_lock)
Nick Piggin's avatar
Nick Piggin committed
243
	__releases(dcache_inode_lock)
244
	__releases(dcache_lock)
245 246
{
	list_del(&dentry->d_u.d_child);
Nick Piggin's avatar
Nick Piggin committed
247 248
	if (parent)
		spin_unlock(&parent->d_lock);
249
	dentry_iput(dentry);
250 251 252 253
	/*
	 * dentry_iput drops the locks, at which point nobody (except
	 * transient RCU lookups) can reach this dentry.
	 */
254
	d_free(dentry);
255
	return parent;
256 257
}

Nick Piggin's avatar
Nick Piggin committed
258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
/**
 * d_drop - drop a dentry
 * @dentry: dentry to drop
 *
 * d_drop() unhashes the entry from the parent dentry hashes, so that it won't
 * be found through a VFS lookup any more. Note that this is different from
 * deleting the dentry - d_delete will try to mark the dentry negative if
 * possible, giving a successful _negative_ lookup, while d_drop will
 * just make the cache lookup fail.
 *
 * d_drop() is used mainly for stuff that wants to invalidate a dentry for some
 * reason (NFS timeouts or autofs deletes).
 *
 * __d_drop requires dentry->d_lock.
 */
void __d_drop(struct dentry *dentry)
{
	if (!(dentry->d_flags & DCACHE_UNHASHED)) {
		dentry->d_flags |= DCACHE_UNHASHED;
		spin_lock(&dcache_hash_lock);
		hlist_del_rcu(&dentry->d_hash);
		spin_unlock(&dcache_hash_lock);
	}
}
EXPORT_SYMBOL(__d_drop);

void d_drop(struct dentry *dentry)
{
	spin_lock(&dcache_lock);
	spin_lock(&dentry->d_lock);
	__d_drop(dentry);
	spin_unlock(&dentry->d_lock);
	spin_unlock(&dcache_lock);
}
EXPORT_SYMBOL(d_drop);

Linus Torvalds's avatar
Linus Torvalds committed
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
/* 
 * This is dput
 *
 * This is complicated by the fact that we do not want to put
 * dentries that are no longer on any hash chain on the unused
 * list: we'd much rather just get rid of them immediately.
 *
 * However, that implies that we have to traverse the dentry
 * tree upwards to the parents which might _also_ now be
 * scheduled for deletion (it may have been only waiting for
 * its last child to go away).
 *
 * This tail recursion is done by hand as we don't want to depend
 * on the compiler to always get this right (gcc generally doesn't).
 * Real recursion would eat up our stack space.
 */

/*
 * dput - release a dentry
 * @dentry: dentry to release 
 *
 * Release a dentry. This will drop the usage count and if appropriate
 * call the dentry unlink method as well as removing it from the queues and
 * releasing its resources. If the parent dentries were scheduled for release
 * they too may now get deleted.
 *
 * no dcache lock, please.
 */

void dput(struct dentry *dentry)
{
Nick Piggin's avatar
Nick Piggin committed
325
	struct dentry *parent;
Linus Torvalds's avatar
Linus Torvalds committed
326 327 328 329
	if (!dentry)
		return;

repeat:
330
	if (dentry->d_count == 1)
Linus Torvalds's avatar
Linus Torvalds committed
331 332
		might_sleep();
	spin_lock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
333 334 335 336
	if (IS_ROOT(dentry))
		parent = NULL;
	else
		parent = dentry->d_parent;
337 338 339 340 341 342 343 344
	if (dentry->d_count == 1) {
		if (!spin_trylock(&dcache_lock)) {
			/*
			 * Something of a livelock possibility we could avoid
			 * by taking dcache_lock and trying again, but we
			 * want to reduce dcache_lock anyway so this will
			 * get improved.
			 */
Nick Piggin's avatar
Nick Piggin committed
345
drop1:
346 347 348
			spin_unlock(&dentry->d_lock);
			goto repeat;
		}
Nick Piggin's avatar
Nick Piggin committed
349 350
		if (!spin_trylock(&dcache_inode_lock)) {
drop2:
Nick Piggin's avatar
Nick Piggin committed
351
			spin_unlock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
352 353 354 355 356
			goto drop1;
		}
		if (parent && !spin_trylock(&parent->d_lock)) {
			spin_unlock(&dcache_inode_lock);
			goto drop2;
Nick Piggin's avatar
Nick Piggin committed
357
		}
358 359 360
	}
	dentry->d_count--;
	if (dentry->d_count) {
Linus Torvalds's avatar
Linus Torvalds committed
361
		spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
362 363
		if (parent)
			spin_unlock(&parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
364 365 366 367 368 369 370 371 372 373 374
		spin_unlock(&dcache_lock);
		return;
	}

	/*
	 * AV: ->d_delete() is _NOT_ allowed to block now.
	 */
	if (dentry->d_op && dentry->d_op->d_delete) {
		if (dentry->d_op->d_delete(dentry))
			goto unhash_it;
	}
375

Linus Torvalds's avatar
Linus Torvalds committed
376 377 378
	/* Unreachable? Get rid of it */
 	if (d_unhashed(dentry))
		goto kill_it;
379 380 381

	/* Otherwise leave it cached and ensure it's on the LRU */
	dentry->d_flags |= DCACHE_REFERENCED;
382
	dentry_lru_add(dentry);
383

Linus Torvalds's avatar
Linus Torvalds committed
384
 	spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
385 386
	if (parent)
		spin_unlock(&parent->d_lock);
Nick Piggin's avatar
Nick Piggin committed
387
	spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
388 389 390 391 392
	spin_unlock(&dcache_lock);
	return;

unhash_it:
	__d_drop(dentry);
393
kill_it:
394 395
	/* if dentry was on the d_lru list delete it from there */
	dentry_lru_del(dentry);
Nick Piggin's avatar
Nick Piggin committed
396
	dentry = d_kill(dentry, parent);
397 398
	if (dentry)
		goto repeat;
Linus Torvalds's avatar
Linus Torvalds committed
399
}
400
EXPORT_SYMBOL(dput);
Linus Torvalds's avatar
Linus Torvalds committed
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419

/**
 * d_invalidate - invalidate a dentry
 * @dentry: dentry to invalidate
 *
 * Try to invalidate the dentry if it turns out to be
 * possible. If there are other dentries that can be
 * reached through this one we can't delete it and we
 * return -EBUSY. On success we return 0.
 *
 * no dcache lock.
 */
 
int d_invalidate(struct dentry * dentry)
{
	/*
	 * If it's already been dropped, return OK.
	 */
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
420
	spin_lock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
421
	if (d_unhashed(dentry)) {
Nick Piggin's avatar
Nick Piggin committed
422
		spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
423 424 425 426 427 428 429 430
		spin_unlock(&dcache_lock);
		return 0;
	}
	/*
	 * Check whether to do a partial shrink_dcache
	 * to get rid of unused child entries.
	 */
	if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin's avatar
Nick Piggin committed
431
		spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
432 433 434
		spin_unlock(&dcache_lock);
		shrink_dcache_parent(dentry);
		spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
435
		spin_lock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
436 437 438 439 440 441 442 443 444 445 446 447
	}

	/*
	 * Somebody else still using it?
	 *
	 * If it's a directory, we can't drop it
	 * for fear of somebody re-populating it
	 * with children (even though dropping it
	 * would make it unreachable from the root,
	 * we might still populate it if it was a
	 * working directory or similar).
	 */
448
	if (dentry->d_count > 1) {
Linus Torvalds's avatar
Linus Torvalds committed
449 450 451 452 453 454 455 456 457 458 459 460
		if (dentry->d_inode && S_ISDIR(dentry->d_inode->i_mode)) {
			spin_unlock(&dentry->d_lock);
			spin_unlock(&dcache_lock);
			return -EBUSY;
		}
	}

	__d_drop(dentry);
	spin_unlock(&dentry->d_lock);
	spin_unlock(&dcache_lock);
	return 0;
}
461
EXPORT_SYMBOL(d_invalidate);
Linus Torvalds's avatar
Linus Torvalds committed
462

463
/* This must be called with dcache_lock and d_lock held */
Nick Piggin's avatar
Nick Piggin committed
464 465
static inline struct dentry * __dget_locked_dlock(struct dentry *dentry)
{
466
	dentry->d_count++;
Nick Piggin's avatar
Nick Piggin committed
467 468 469 470
	dentry_lru_del(dentry);
	return dentry;
}

471
/* This should be called _only_ with dcache_lock held */
Linus Torvalds's avatar
Linus Torvalds committed
472 473
static inline struct dentry * __dget_locked(struct dentry *dentry)
{
Nick Piggin's avatar
Nick Piggin committed
474
	spin_lock(&dentry->d_lock);
475
	__dget_locked_dlock(dentry);
Nick Piggin's avatar
Nick Piggin committed
476
	spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
477 478 479
	return dentry;
}

480 481 482 483 484
struct dentry * dget_locked_dlock(struct dentry *dentry)
{
	return __dget_locked_dlock(dentry);
}

Linus Torvalds's avatar
Linus Torvalds committed
485 486 487 488
struct dentry * dget_locked(struct dentry *dentry)
{
	return __dget_locked(dentry);
}
489
EXPORT_SYMBOL(dget_locked);
Linus Torvalds's avatar
Linus Torvalds committed
490

491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
struct dentry *dget_parent(struct dentry *dentry)
{
	struct dentry *ret;

repeat:
	spin_lock(&dentry->d_lock);
	ret = dentry->d_parent;
	if (!ret)
		goto out;
	if (dentry == ret) {
		ret->d_count++;
		goto out;
	}
	if (!spin_trylock(&ret->d_lock)) {
		spin_unlock(&dentry->d_lock);
		cpu_relax();
		goto repeat;
	}
	BUG_ON(!ret->d_count);
	ret->d_count++;
	spin_unlock(&ret->d_lock);
out:
	spin_unlock(&dentry->d_lock);
	return ret;
}
EXPORT_SYMBOL(dget_parent);

Linus Torvalds's avatar
Linus Torvalds committed
518 519 520 521 522 523 524 525 526 527 528 529
/**
 * d_find_alias - grab a hashed alias of inode
 * @inode: inode in question
 * @want_discon:  flag, used by d_splice_alias, to request
 *          that only a DISCONNECTED alias be returned.
 *
 * If inode has a hashed alias, or is a directory and has any alias,
 * acquire the reference to alias and return it. Otherwise return NULL.
 * Notice that if inode is a directory there can be only one alias and
 * it can be unhashed only if it has no children, or if it is the root
 * of a filesystem.
 *
530
 * If the inode has an IS_ROOT, DCACHE_DISCONNECTED alias, then prefer
Linus Torvalds's avatar
Linus Torvalds committed
531
 * any other hashed alias over that one unless @want_discon is set,
532
 * in which case only return an IS_ROOT, DCACHE_DISCONNECTED alias.
Linus Torvalds's avatar
Linus Torvalds committed
533
 */
Nick Piggin's avatar
Nick Piggin committed
534
static struct dentry *__d_find_alias(struct inode *inode, int want_discon)
Linus Torvalds's avatar
Linus Torvalds committed
535
{
Nick Piggin's avatar
Nick Piggin committed
536
	struct dentry *alias, *discon_alias;
Linus Torvalds's avatar
Linus Torvalds committed
537

Nick Piggin's avatar
Nick Piggin committed
538 539 540 541
again:
	discon_alias = NULL;
	list_for_each_entry(alias, &inode->i_dentry, d_alias) {
		spin_lock(&alias->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
542
 		if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
543
			if (IS_ROOT(alias) &&
Nick Piggin's avatar
Nick Piggin committed
544
			    (alias->d_flags & DCACHE_DISCONNECTED)) {
Linus Torvalds's avatar
Linus Torvalds committed
545
				discon_alias = alias;
Nick Piggin's avatar
Nick Piggin committed
546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561
			} else if (!want_discon) {
				__dget_locked_dlock(alias);
				spin_unlock(&alias->d_lock);
				return alias;
			}
		}
		spin_unlock(&alias->d_lock);
	}
	if (discon_alias) {
		alias = discon_alias;
		spin_lock(&alias->d_lock);
		if (S_ISDIR(inode->i_mode) || !d_unhashed(alias)) {
			if (IS_ROOT(alias) &&
			    (alias->d_flags & DCACHE_DISCONNECTED)) {
				__dget_locked_dlock(alias);
				spin_unlock(&alias->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
562 563 564
				return alias;
			}
		}
Nick Piggin's avatar
Nick Piggin committed
565 566
		spin_unlock(&alias->d_lock);
		goto again;
Linus Torvalds's avatar
Linus Torvalds committed
567
	}
Nick Piggin's avatar
Nick Piggin committed
568
	return NULL;
Linus Torvalds's avatar
Linus Torvalds committed
569 570
}

Nick Piggin's avatar
Nick Piggin committed
571
struct dentry *d_find_alias(struct inode *inode)
Linus Torvalds's avatar
Linus Torvalds committed
572
{
573 574 575 576
	struct dentry *de = NULL;

	if (!list_empty(&inode->i_dentry)) {
		spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
577
		spin_lock(&dcache_inode_lock);
578
		de = __d_find_alias(inode, 0);
Nick Piggin's avatar
Nick Piggin committed
579
		spin_unlock(&dcache_inode_lock);
580 581
		spin_unlock(&dcache_lock);
	}
Linus Torvalds's avatar
Linus Torvalds committed
582 583
	return de;
}
584
EXPORT_SYMBOL(d_find_alias);
Linus Torvalds's avatar
Linus Torvalds committed
585 586 587 588 589 590 591

/*
 *	Try to kill dentries associated with this inode.
 * WARNING: you must own a reference to inode.
 */
void d_prune_aliases(struct inode *inode)
{
592
	struct dentry *dentry;
Linus Torvalds's avatar
Linus Torvalds committed
593 594
restart:
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
595
	spin_lock(&dcache_inode_lock);
596
	list_for_each_entry(dentry, &inode->i_dentry, d_alias) {
Linus Torvalds's avatar
Linus Torvalds committed
597
		spin_lock(&dentry->d_lock);
598
		if (!dentry->d_count) {
Nick Piggin's avatar
Nick Piggin committed
599
			__dget_locked_dlock(dentry);
Linus Torvalds's avatar
Linus Torvalds committed
600 601
			__d_drop(dentry);
			spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
602
			spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
603 604 605 606 607 608
			spin_unlock(&dcache_lock);
			dput(dentry);
			goto restart;
		}
		spin_unlock(&dentry->d_lock);
	}
Nick Piggin's avatar
Nick Piggin committed
609
	spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
610 611
	spin_unlock(&dcache_lock);
}
612
EXPORT_SYMBOL(d_prune_aliases);
Linus Torvalds's avatar
Linus Torvalds committed
613 614

/*
615 616 617
 * Throw away a dentry - free the inode, dput the parent.  This requires that
 * the LRU list has already been removed.
 *
618 619 620
 * Try to prune ancestors as well.  This is necessary to prevent
 * quadratic behavior of shrink_dcache_parent(), but is also expected
 * to be beneficial in reducing dentry cache fragmentation.
Linus Torvalds's avatar
Linus Torvalds committed
621
 */
Nick Piggin's avatar
Nick Piggin committed
622
static void prune_one_dentry(struct dentry *dentry, struct dentry *parent)
623
	__releases(dentry->d_lock)
Nick Piggin's avatar
Nick Piggin committed
624
	__releases(parent->d_lock)
Nick Piggin's avatar
Nick Piggin committed
625
	__releases(dcache_inode_lock)
626
	__releases(dcache_lock)
Linus Torvalds's avatar
Linus Torvalds committed
627 628
{
	__d_drop(dentry);
Nick Piggin's avatar
Nick Piggin committed
629
	dentry = d_kill(dentry, parent);
630 631 632 633 634 635

	/*
	 * Prune ancestors.  Locking is simpler than in dput(),
	 * because dcache_lock needs to be taken anyway.
	 */
	while (dentry) {
Nick Piggin's avatar
Nick Piggin committed
636
		spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
637
		spin_lock(&dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
638
again:
639
		spin_lock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
640 641 642 643 644 645 646 647
		if (IS_ROOT(dentry))
			parent = NULL;
		else
			parent = dentry->d_parent;
		if (parent && !spin_trylock(&parent->d_lock)) {
			spin_unlock(&dentry->d_lock);
			goto again;
		}
648 649
		dentry->d_count--;
		if (dentry->d_count) {
Nick Piggin's avatar
Nick Piggin committed
650 651
			if (parent)
				spin_unlock(&parent->d_lock);
652
			spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
653
			spin_unlock(&dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
654
			spin_unlock(&dcache_lock);
655
			return;
Nick Piggin's avatar
Nick Piggin committed
656
		}
657

658
		dentry_lru_del(dentry);
659
		__d_drop(dentry);
Nick Piggin's avatar
Nick Piggin committed
660
		dentry = d_kill(dentry, parent);
661
	}
Linus Torvalds's avatar
Linus Torvalds committed
662 663
}

664
static void shrink_dentry_list(struct list_head *list)
Linus Torvalds's avatar
Linus Torvalds committed
665
{
666 667
	struct dentry *dentry;

668
	while (!list_empty(list)) {
Nick Piggin's avatar
Nick Piggin committed
669 670
		struct dentry *parent;

671
		dentry = list_entry(list->prev, struct dentry, d_lru);
Nick Piggin's avatar
Nick Piggin committed
672 673

		if (!spin_trylock(&dentry->d_lock)) {
Nick Piggin's avatar
Nick Piggin committed
674
relock:
Nick Piggin's avatar
Nick Piggin committed
675 676 677 678 679 680
			spin_unlock(&dcache_lru_lock);
			cpu_relax();
			spin_lock(&dcache_lru_lock);
			continue;
		}

Linus Torvalds's avatar
Linus Torvalds committed
681 682
		/*
		 * We found an inuse dentry which was not removed from
683 684
		 * the LRU because of laziness during lookup.  Do not free
		 * it - just keep it off the LRU list.
Linus Torvalds's avatar
Linus Torvalds committed
685
		 */
686
		if (dentry->d_count) {
Nick Piggin's avatar
Nick Piggin committed
687
			__dentry_lru_del(dentry);
688
			spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
689 690
			continue;
		}
Nick Piggin's avatar
Nick Piggin committed
691 692 693 694 695 696 697 698 699
		if (IS_ROOT(dentry))
			parent = NULL;
		else
			parent = dentry->d_parent;
		if (parent && !spin_trylock(&parent->d_lock)) {
			spin_unlock(&dentry->d_lock);
			goto relock;
		}
		__dentry_lru_del(dentry);
Nick Piggin's avatar
Nick Piggin committed
700 701
		spin_unlock(&dcache_lru_lock);

Nick Piggin's avatar
Nick Piggin committed
702
		prune_one_dentry(dentry, parent);
Nick Piggin's avatar
Nick Piggin committed
703
		/* dcache_lock, dcache_inode_lock and dentry->d_lock dropped */
Nick Piggin's avatar
Nick Piggin committed
704
		spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
705
		spin_lock(&dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
706
		spin_lock(&dcache_lru_lock);
707
	}
708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726
}

/**
 * __shrink_dcache_sb - shrink the dentry LRU on a given superblock
 * @sb:		superblock to shrink dentry LRU.
 * @count:	number of entries to prune
 * @flags:	flags to control the dentry processing
 *
 * If flags contains DCACHE_REFERENCED reference dentries will not be pruned.
 */
static void __shrink_dcache_sb(struct super_block *sb, int *count, int flags)
{
	/* called from prune_dcache() and shrink_dcache_parent() */
	struct dentry *dentry;
	LIST_HEAD(referenced);
	LIST_HEAD(tmp);
	int cnt = *count;

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
727
	spin_lock(&dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
728 729
relock:
	spin_lock(&dcache_lru_lock);
730 731 732 733 734
	while (!list_empty(&sb->s_dentry_lru)) {
		dentry = list_entry(sb->s_dentry_lru.prev,
				struct dentry, d_lru);
		BUG_ON(dentry->d_sb != sb);

Nick Piggin's avatar
Nick Piggin committed
735 736 737 738 739 740
		if (!spin_trylock(&dentry->d_lock)) {
			spin_unlock(&dcache_lru_lock);
			cpu_relax();
			goto relock;
		}

741 742 743 744 745
		/*
		 * If we are honouring the DCACHE_REFERENCED flag and the
		 * dentry has this flag set, don't free it.  Clear the flag
		 * and put it back on the LRU.
		 */
Nick Piggin's avatar
Nick Piggin committed
746 747 748 749
		if (flags & DCACHE_REFERENCED &&
				dentry->d_flags & DCACHE_REFERENCED) {
			dentry->d_flags &= ~DCACHE_REFERENCED;
			list_move(&dentry->d_lru, &referenced);
750
			spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
751 752 753 754 755
		} else {
			list_move_tail(&dentry->d_lru, &tmp);
			spin_unlock(&dentry->d_lock);
			if (!--cnt)
				break;
756
		}
Nick Piggin's avatar
Nick Piggin committed
757
		/* XXX: re-add cond_resched_lock when dcache_lock goes away */
758 759 760 761 762
	}

	*count = cnt;
	shrink_dentry_list(&tmp);

763 764
	if (!list_empty(&referenced))
		list_splice(&referenced, &sb->s_dentry_lru);
Nick Piggin's avatar
Nick Piggin committed
765
	spin_unlock(&dcache_lru_lock);
Nick Piggin's avatar
Nick Piggin committed
766
	spin_unlock(&dcache_inode_lock);
767 768 769 770 771 772 773 774 775 776 777 778 779 780
	spin_unlock(&dcache_lock);
}

/**
 * prune_dcache - shrink the dcache
 * @count: number of entries to try to free
 *
 * Shrink the dcache. This is done when we need more memory, or simply when we
 * need to unmount something (at which point we need to unuse all dentries).
 *
 * This function may fail to free any resources if all the dentries are in use.
 */
static void prune_dcache(int count)
{
781
	struct super_block *sb, *p = NULL;
782
	int w_count;
783
	int unused = dentry_stat.nr_unused;
784 785 786 787 788 789 790 791 792 793 794
	int prune_ratio;
	int pruned;

	if (unused == 0 || count == 0)
		return;
	spin_lock(&dcache_lock);
	if (count >= unused)
		prune_ratio = 1;
	else
		prune_ratio = unused / count;
	spin_lock(&sb_lock);
795
	list_for_each_entry(sb, &super_blocks, s_list) {
796 797
		if (list_empty(&sb->s_instances))
			continue;
798
		if (sb->s_nr_dentry_unused == 0)
Linus Torvalds's avatar
Linus Torvalds committed
799
			continue;
800 801 802 803 804 805 806 807 808
		sb->s_count++;
		/* Now, we reclaim unused dentrins with fairness.
		 * We reclaim them same percentage from each superblock.
		 * We calculate number of dentries to scan on this sb
		 * as follows, but the implementation is arranged to avoid
		 * overflows:
		 * number of dentries to scan on this sb =
		 * count * (number of dentries on this sb /
		 * number of dentries in the machine)
809
		 */
810 811 812 813 814 815
		spin_unlock(&sb_lock);
		if (prune_ratio != 1)
			w_count = (sb->s_nr_dentry_unused / prune_ratio) + 1;
		else
			w_count = sb->s_nr_dentry_unused;
		pruned = w_count;
816
		/*
817 818 819 820 821
		 * We need to be sure this filesystem isn't being unmounted,
		 * otherwise we could race with generic_shutdown_super(), and
		 * end up holding a reference to an inode while the filesystem
		 * is unmounted.  So we try to get s_umount, and make sure
		 * s_root isn't NULL.
822
		 */
823 824 825 826 827 828 829 830
		if (down_read_trylock(&sb->s_umount)) {
			if ((sb->s_root != NULL) &&
			    (!list_empty(&sb->s_dentry_lru))) {
				spin_unlock(&dcache_lock);
				__shrink_dcache_sb(sb, &w_count,
						DCACHE_REFERENCED);
				pruned -= w_count;
				spin_lock(&dcache_lock);
831
			}
832
			up_read(&sb->s_umount);
833
		}
834
		spin_lock(&sb_lock);
835 836
		if (p)
			__put_super(p);
837
		count -= pruned;
838
		p = sb;
Al Viro's avatar
Al Viro committed
839 840 841
		/* more work left to do? */
		if (count <= 0)
			break;
Linus Torvalds's avatar
Linus Torvalds committed
842
	}
843 844
	if (p)
		__put_super(p);
845
	spin_unlock(&sb_lock);
Linus Torvalds's avatar
Linus Torvalds committed
846 847 848 849 850 851 852
	spin_unlock(&dcache_lock);
}

/**
 * shrink_dcache_sb - shrink dcache for a superblock
 * @sb: superblock
 *
853 854
 * Shrink the dcache for the specified super block. This is used to free
 * the dcache before unmounting a file system.
Linus Torvalds's avatar
Linus Torvalds committed
855
 */
856
void shrink_dcache_sb(struct super_block *sb)
Linus Torvalds's avatar
Linus Torvalds committed
857
{
858 859 860
	LIST_HEAD(tmp);

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
861
	spin_lock(&dcache_inode_lock);
Nick Piggin's avatar
Nick Piggin committed
862
	spin_lock(&dcache_lru_lock);
863 864 865 866
	while (!list_empty(&sb->s_dentry_lru)) {
		list_splice_init(&sb->s_dentry_lru, &tmp);
		shrink_dentry_list(&tmp);
	}
Nick Piggin's avatar
Nick Piggin committed
867
	spin_unlock(&dcache_lru_lock);
Nick Piggin's avatar
Nick Piggin committed
868
	spin_unlock(&dcache_inode_lock);
869
	spin_unlock(&dcache_lock);
Linus Torvalds's avatar
Linus Torvalds committed
870
}
871
EXPORT_SYMBOL(shrink_dcache_sb);
Linus Torvalds's avatar
Linus Torvalds committed
872

873 874 875 876 877 878 879 880
/*
 * destroy a single subtree of dentries for unmount
 * - see the comments on shrink_dcache_for_umount() for a description of the
 *   locking
 */
static void shrink_dcache_for_umount_subtree(struct dentry *dentry)
{
	struct dentry *parent;
881
	unsigned detached = 0;
882 883 884 885 886

	BUG_ON(!IS_ROOT(dentry));

	/* detach this root from the system */
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
887
	spin_lock(&dentry->d_lock);
888
	dentry_lru_del(dentry);
889
	__d_drop(dentry);
Nick Piggin's avatar
Nick Piggin committed
890
	spin_unlock(&dentry->d_lock);
891 892 893 894 895 896 897 898 899 900
	spin_unlock(&dcache_lock);

	for (;;) {
		/* descend to the first leaf in the current subtree */
		while (!list_empty(&dentry->d_subdirs)) {
			struct dentry *loop;

			/* this is a branch with children - detach all of them
			 * from the system in one go */
			spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
901
			spin_lock(&dentry->d_lock);
902 903
			list_for_each_entry(loop, &dentry->d_subdirs,
					    d_u.d_child) {
Nick Piggin's avatar
Nick Piggin committed
904 905
				spin_lock_nested(&loop->d_lock,
						DENTRY_D_LOCK_NESTED);
906
				dentry_lru_del(loop);
907
				__d_drop(loop);
Nick Piggin's avatar
Nick Piggin committed
908
				spin_unlock(&loop->d_lock);
909
			}
Nick Piggin's avatar
Nick Piggin committed
910
			spin_unlock(&dentry->d_lock);
911 912 913 914 915 916 917 918 919 920 921 922
			spin_unlock(&dcache_lock);

			/* move to the first child */
			dentry = list_entry(dentry->d_subdirs.next,
					    struct dentry, d_u.d_child);
		}

		/* consume the dentries from this leaf up through its parents
		 * until we find one with children or run out altogether */
		do {
			struct inode *inode;

923
			if (dentry->d_count != 0) {
924 925 926 927 928 929 930 931
				printk(KERN_ERR
				       "BUG: Dentry %p{i=%lx,n=%s}"
				       " still in use (%d)"
				       " [unmount of %s %s]\n",
				       dentry,
				       dentry->d_inode ?
				       dentry->d_inode->i_ino : 0UL,
				       dentry->d_name.name,
932
				       dentry->d_count,
933 934 935 936 937
				       dentry->d_sb->s_type->name,
				       dentry->d_sb->s_id);
				BUG();
			}

Nick Piggin's avatar
Nick Piggin committed
938
			if (IS_ROOT(dentry)) {
939
				parent = NULL;
Nick Piggin's avatar
Nick Piggin committed
940 941
				list_del(&dentry->d_u.d_child);
			} else {
942
				parent = dentry->d_parent;
943 944
				spin_lock(&parent->d_lock);
				parent->d_count--;
Nick Piggin's avatar
Nick Piggin committed
945
				list_del(&dentry->d_u.d_child);
946
				spin_unlock(&parent->d_lock);
947
			}
948

949
			detached++;
950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966

			inode = dentry->d_inode;
			if (inode) {
				dentry->d_inode = NULL;
				list_del_init(&dentry->d_alias);
				if (dentry->d_op && dentry->d_op->d_iput)
					dentry->d_op->d_iput(dentry, inode);
				else
					iput(inode);
			}

			d_free(dentry);

			/* finished when we fall off the top of the tree,
			 * otherwise we ascend to the parent and move to the
			 * next sibling if there is one */
			if (!parent)
967
				return;
968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995
			dentry = parent;
		} while (list_empty(&dentry->d_subdirs));

		dentry = list_entry(dentry->d_subdirs.next,
				    struct dentry, d_u.d_child);
	}
}

/*
 * destroy the dentries attached to a superblock on unmounting
 * - we don't need to use dentry->d_lock, and only need dcache_lock when
 *   removing the dentry from the system lists and hashes because:
 *   - the superblock is detached from all mountings and open files, so the
 *     dentry trees will not be rearranged by the VFS
 *   - s_umount is write-locked, so the memory pressure shrinker will ignore
 *     any dentries belonging to this superblock that it comes across
 *   - the filesystem itself is no longer permitted to rearrange the dentries
 *     in this superblock
 */
void shrink_dcache_for_umount(struct super_block *sb)
{
	struct dentry *dentry;

	if (down_read_trylock(&sb->s_umount))
		BUG();

	dentry = sb->s_root;
	sb->s_root = NULL;
996 997 998
	spin_lock(&dentry->d_lock);
	dentry->d_count--;
	spin_unlock(&dentry->d_lock);
999 1000 1001 1002 1003 1004 1005 1006
	shrink_dcache_for_umount_subtree(dentry);

	while (!hlist_empty(&sb->s_anon)) {
		dentry = hlist_entry(sb->s_anon.first, struct dentry, d_hash);
		shrink_dcache_for_umount_subtree(dentry);
	}
}

Linus Torvalds's avatar
Linus Torvalds committed
1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
/*
 * Search for at least 1 mount point in the dentry's subdirs.
 * We descend to the next level whenever the d_subdirs
 * list is non-empty and continue searching.
 */
 
/**
 * have_submounts - check for mounts over a dentry
 * @parent: dentry to check.
 *
 * Return true if the parent or its subdirectories contain
 * a mount point
 */
 
int have_submounts(struct dentry *parent)
{
	struct dentry *this_parent = parent;
	struct list_head *next;

	spin_lock(&dcache_lock);
	if (d_mountpoint(parent))
		goto positive;
Nick Piggin's avatar
Nick Piggin committed
1029
	spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1030 1031 1032 1033 1034
repeat:
	next = this_parent->d_subdirs.next;
resume:
	while (next != &this_parent->d_subdirs) {
		struct list_head *tmp = next;
Eric Dumazet's avatar
Eric Dumazet committed
1035
		struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
1036
		next = tmp->next;
Nick Piggin's avatar
Nick Piggin committed
1037 1038

		spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Linus Torvalds's avatar
Linus Torvalds committed
1039
		/* Have we found a mount point ? */
Nick Piggin's avatar
Nick Piggin committed
1040 1041 1042
		if (d_mountpoint(dentry)) {
			spin_unlock(&dentry->d_lock);
			spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1043
			goto positive;
Nick Piggin's avatar
Nick Piggin committed
1044
		}
Linus Torvalds's avatar
Linus Torvalds committed
1045
		if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin's avatar
Nick Piggin committed
1046 1047
			spin_unlock(&this_parent->d_lock);
			spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
1048
			this_parent = dentry;
Nick Piggin's avatar
Nick Piggin committed
1049
			spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
1050 1051
			goto repeat;
		}
Nick Piggin's avatar
Nick Piggin committed
1052
		spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1053 1054 1055 1056 1057
	}
	/*
	 * All done at this level ... ascend and resume the search.
	 */
	if (this_parent != parent) {
Eric Dumazet's avatar
Eric Dumazet committed
1058
		next = this_parent->d_u.d_child.next;
Nick Piggin's avatar
Nick Piggin committed
1059
		spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1060
		this_parent = this_parent->d_parent;
Nick Piggin's avatar
Nick Piggin committed
1061
		spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1062 1063
		goto resume;
	}
Nick Piggin's avatar
Nick Piggin committed
1064
	spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1065 1066 1067 1068 1069 1070
	spin_unlock(&dcache_lock);
	return 0; /* No mount points found in tree */
positive:
	spin_unlock(&dcache_lock);
	return 1;
}
1071
EXPORT_SYMBOL(have_submounts);
Linus Torvalds's avatar
Linus Torvalds committed
1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093

/*
 * Search the dentry child list for the specified parent,
 * and move any unused dentries to the end of the unused
 * list for prune_dcache(). We descend to the next level
 * whenever the d_subdirs list is non-empty and continue
 * searching.
 *
 * It returns zero iff there are no unused children,
 * otherwise  it returns the number of children moved to
 * the end of the unused list. This may not be the total
 * number of unused children, because select_parent can
 * drop the lock and return early due to latency
 * constraints.
 */
static int select_parent(struct dentry * parent)
{
	struct dentry *this_parent = parent;
	struct list_head *next;
	int found = 0;

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1094
	spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1095 1096 1097 1098 1099
repeat:
	next = this_parent->d_subdirs.next;
resume:
	while (next != &this_parent->d_subdirs) {
		struct list_head *tmp = next;
Eric Dumazet's avatar
Eric Dumazet committed
1100
		struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
1101
		next = tmp->next;
Nick Piggin's avatar
Nick Piggin committed
1102
		BUG_ON(this_parent == dentry);
Linus Torvalds's avatar
Linus Torvalds committed
1103

Nick Piggin's avatar
Nick Piggin committed
1104
		spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
Nick Piggin's avatar
Nick Piggin committed
1105

Linus Torvalds's avatar
Linus Torvalds committed
1106 1107 1108 1109
		/* 
		 * move only zero ref count dentries to the end 
		 * of the unused list for prune_dcache
		 */
1110
		if (!dentry->d_count) {
1111
			dentry_lru_move_tail(dentry);
Linus Torvalds's avatar
Linus Torvalds committed
1112
			found++;
1113 1114
		} else {
			dentry_lru_del(dentry);
Linus Torvalds's avatar
Linus Torvalds committed
1115 1116 1117 1118 1119 1120 1121
		}

		/*
		 * We can return to the caller if we have found some (this
		 * ensures forward progress). We'll be coming back to find
		 * the rest.
		 */
Nick Piggin's avatar
Nick Piggin committed
1122 1123
		if (found && need_resched()) {
			spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1124
			goto out;
Nick Piggin's avatar
Nick Piggin committed
1125
		}
Linus Torvalds's avatar
Linus Torvalds committed
1126 1127 1128 1129 1130

		/*
		 * Descend a level if the d_subdirs list is non-empty.
		 */
		if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin's avatar
Nick Piggin committed
1131 1132
			spin_unlock(&this_parent->d_lock);
			spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
1133
			this_parent = dentry;
Nick Piggin's avatar
Nick Piggin committed
1134
			spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
1135 1136
			goto repeat;
		}
Nick Piggin's avatar
Nick Piggin committed
1137 1138

		spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1139 1140 1141 1142 1143
	}
	/*
	 * All done at this level ... ascend and resume the search.
	 */
	if (this_parent != parent) {
Nick Piggin's avatar
Nick Piggin committed
1144
		struct dentry *tmp;
Eric Dumazet's avatar
Eric Dumazet committed
1145
		next = this_parent->d_u.d_child.next;
Nick Piggin's avatar
Nick Piggin committed
1146 1147 1148 1149 1150
		tmp = this_parent->d_parent;
		spin_unlock(&this_parent->d_lock);
		BUG_ON(tmp == this_parent);
		this_parent = tmp;
		spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1151 1152 1153
		goto resume;
	}
out:
Nick Piggin's avatar
Nick Piggin committed
1154
	spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167
	spin_unlock(&dcache_lock);
	return found;
}

/**
 * shrink_dcache_parent - prune dcache
 * @parent: parent of entries to prune
 *
 * Prune the dcache to remove unused children of the parent dentry.
 */
 
void shrink_dcache_parent(struct dentry * parent)
{
1168
	struct super_block *sb = parent->d_sb;
Linus Torvalds's avatar
Linus Torvalds committed
1169 1170 1171
	int found;

	while ((found = select_parent(parent)) != 0)
1172
		__shrink_dcache_sb(sb, &found, 0);
Linus Torvalds's avatar
Linus Torvalds committed
1173
}
1174
EXPORT_SYMBOL(shrink_dcache_parent);
Linus Torvalds's avatar
Linus Torvalds committed
1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187

/*
 * Scan `nr' dentries and return the number which remain.
 *
 * We need to avoid reentering the filesystem if the caller is performing a
 * GFP_NOFS allocation attempt.  One example deadlock is:
 *
 * ext2_new_block->getblk->GFP->shrink_dcache_memory->prune_dcache->
 * prune_one_dentry->dput->dentry_iput->iput->inode->i_sb->s_op->put_inode->
 * ext2_discard_prealloc->ext2_free_blocks->lock_super->DEADLOCK.
 *
 * In this case we return -1 to tell the caller that we baled.
 */
1188
static int shrink_dcache_memory(struct shrinker *shrink, int nr, gfp_t gfp_mask)
Linus Torvalds's avatar
Linus Torvalds committed
1189 1190 1191 1192
{
	if (nr) {
		if (!(gfp_mask & __GFP_FS))
			return -1;
1193
		prune_dcache(nr);
Linus Torvalds's avatar
Linus Torvalds committed
1194
	}
1195

1196
	return (dentry_stat.nr_unused / 100) * sysctl_vfs_cache_pressure;
Linus Torvalds's avatar
Linus Torvalds committed
1197 1198
}

1199 1200 1201 1202 1203
static struct shrinker dcache_shrinker = {
	.shrink = shrink_dcache_memory,
	.seeks = DEFAULT_SEEKS,
};

Linus Torvalds's avatar
Linus Torvalds committed
1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218
/**
 * d_alloc	-	allocate a dcache entry
 * @parent: parent of entry to allocate
 * @name: qstr of the name
 *
 * Allocates a dentry. It returns %NULL if there is insufficient memory
 * available. On a success the dentry is returned. The name passed in is
 * copied and the copy passed in may be reused after this call.
 */
 
struct dentry *d_alloc(struct dentry * parent, const struct qstr *name)
{
	struct dentry *dentry;
	char *dname;

1219
	dentry = kmem_cache_alloc(dentry_cache, GFP_KERNEL);
Linus Torvalds's avatar
Linus Torvalds committed
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238
	if (!dentry)
		return NULL;

	if (name->len > DNAME_INLINE_LEN-1) {
		dname = kmalloc(name->len + 1, GFP_KERNEL);
		if (!dname) {
			kmem_cache_free(dentry_cache, dentry); 
			return NULL;
		}
	} else  {
		dname = dentry->d_iname;
	}	
	dentry->d_name.name = dname;

	dentry->d_name.len = name->len;
	dentry->d_name.hash = name->hash;
	memcpy(dname, name->name, name->len);
	dname[name->len] = 0;

1239
	dentry->d_count = 1;
Linus Torvalds's avatar
Linus Torvalds committed
1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251
	dentry->d_flags = DCACHE_UNHASHED;
	spin_lock_init(&dentry->d_lock);
	dentry->d_inode = NULL;
	dentry->d_parent = NULL;
	dentry->d_sb = NULL;
	dentry->d_op = NULL;
	dentry->d_fsdata = NULL;
	dentry->d_mounted = 0;
	INIT_HLIST_NODE(&dentry->d_hash);
	INIT_LIST_HEAD(&dentry->d_lru);
	INIT_LIST_HEAD(&dentry->d_subdirs);
	INIT_LIST_HEAD(&dentry->d_alias);
Nick Piggin's avatar
Nick Piggin committed
1252
	INIT_LIST_HEAD(&dentry->d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
1253 1254

	if (parent) {
Nick Piggin's avatar
Nick Piggin committed
1255 1256 1257 1258
		spin_lock(&dcache_lock);
		spin_lock(&parent->d_lock);
		spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
		dentry->d_parent = dget_dlock(parent);
Linus Torvalds's avatar
Linus Torvalds committed
1259
		dentry->d_sb = parent->d_sb;
Eric Dumazet's avatar
Eric Dumazet committed
1260
		list_add(&dentry->d_u.d_child, &parent->d_subdirs);
Nick Piggin's avatar
Nick Piggin committed
1261 1262 1263 1264
		spin_unlock(&dentry->d_lock);
		spin_unlock(&parent->d_lock);
		spin_unlock(&dcache_lock);
	}
Linus Torvalds's avatar
Linus Torvalds committed
1265

1266
	this_cpu_inc(nr_dentry);
1267

Linus Torvalds's avatar
Linus Torvalds committed
1268 1269
	return dentry;
}
1270
EXPORT_SYMBOL(d_alloc);
Linus Torvalds's avatar
Linus Torvalds committed
1271 1272 1273 1274 1275 1276 1277 1278 1279 1280

struct dentry *d_alloc_name(struct dentry *parent, const char *name)
{
	struct qstr q;

	q.name = name;
	q.len = strlen(name);
	q.hash = full_name_hash(q.name, q.len);
	return d_alloc(parent, &q);
}
1281
EXPORT_SYMBOL(d_alloc_name);
Linus Torvalds's avatar
Linus Torvalds committed
1282

1283 1284 1285
/* the caller must hold dcache_lock */
static void __d_instantiate(struct dentry *dentry, struct inode *inode)
{
Nick Piggin's avatar
Nick Piggin committed
1286
	spin_lock(&dentry->d_lock);
1287 1288 1289
	if (inode)
		list_add(&dentry->d_alias, &inode->i_dentry);
	dentry->d_inode = inode;
Nick Piggin's avatar
Nick Piggin committed
1290
	spin_unlock(&dentry->d_lock);
1291 1292 1293
	fsnotify_d_instantiate(dentry, inode);
}

Linus Torvalds's avatar
Linus Torvalds committed
1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310
/**
 * d_instantiate - fill in inode information for a dentry
 * @entry: dentry to complete
 * @inode: inode to attach to this dentry
 *
 * Fill in inode information in the entry.
 *
 * This turns negative dentries into productive full members
 * of society.
 *
 * NOTE! This assumes that the inode count has been incremented
 * (or otherwise set) by the caller to indicate that it is now
 * in use by the dcache.
 */
 
void d_instantiate(struct dentry *entry, struct inode * inode)
{
1311
	BUG_ON(!list_empty(&entry->d_alias));
Linus Torvalds's avatar
Linus Torvalds committed
1312
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1313
	spin_lock(&dcache_inode_lock);
1314
	__d_instantiate(entry, inode);
Nick Piggin's avatar
Nick Piggin committed
1315
	spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1316 1317 1318
	spin_unlock(&dcache_lock);
	security_d_instantiate(entry, inode);
}
1319
EXPORT_SYMBOL(d_instantiate);
Linus Torvalds's avatar
Linus Torvalds committed
1320 1321 1322 1323 1324 1325 1326 1327

/**
 * d_instantiate_unique - instantiate a non-aliased dentry
 * @entry: dentry to instantiate
 * @inode: inode to attach to this dentry
 *
 * Fill in inode information in the entry. On success, it returns NULL.
 * If an unhashed alias of "entry" already exists, then we return the
1328
 * aliased dentry instead and drop one reference to inode.
Linus Torvalds's avatar
Linus Torvalds committed
1329 1330 1331
 *
 * Note that in order to avoid conflicts with rename() etc, the caller
 * had better be holding the parent directory semaphore.
1332 1333 1334 1335
 *
 * This also assumes that the inode count has been incremented
 * (or otherwise set) by the caller to indicate that it is now
 * in use by the dcache.
Linus Torvalds's avatar
Linus Torvalds committed
1336
 */
1337 1338
static struct dentry *__d_instantiate_unique(struct dentry *entry,
					     struct inode *inode)
Linus Torvalds's avatar
Linus Torvalds committed
1339 1340 1341 1342 1343 1344
{
	struct dentry *alias;
	int len = entry->d_name.len;
	const char *name = entry->d_name.name;
	unsigned int hash = entry->d_name.hash;

1345
	if (!inode) {
1346
		__d_instantiate(entry, NULL);
1347 1348 1349
		return NULL;
	}

Linus Torvalds's avatar
Linus Torvalds committed
1350 1351 1352
	list_for_each_entry(alias, &inode->i_dentry, d_alias) {
		struct qstr *qstr = &alias->d_name;

1353 1354 1355 1356 1357
		/*
		 * Don't need alias->d_lock here, because aliases with
		 * d_parent == entry->d_parent are not subject to name or
		 * parent changes, because the parent inode i_mutex is held.
		 */
Linus Torvalds's avatar
Linus Torvalds committed
1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368
		if (qstr->hash != hash)
			continue;
		if (alias->d_parent != entry->d_parent)
			continue;
		if (qstr->len != len)
			continue;
		if (memcmp(qstr->name, name, len))
			continue;
		dget_locked(alias);
		return alias;
	}
1369

1370
	__d_instantiate(entry, inode);
Linus Torvalds's avatar
Linus Torvalds committed
1371 1372
	return NULL;
}
1373 1374 1375 1376 1377 1378 1379 1380

struct dentry *d_instantiate_unique(struct dentry *entry, struct inode *inode)
{
	struct dentry *result;

	BUG_ON(!list_empty(&entry->d_alias));

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1381
	spin_lock(&dcache_inode_lock);
1382
	result = __d_instantiate_unique(entry, inode);
Nick Piggin's avatar
Nick Piggin committed
1383
	spin_unlock(&dcache_inode_lock);
1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395
	spin_unlock(&dcache_lock);

	if (!result) {
		security_d_instantiate(entry, inode);
		return NULL;
	}

	BUG_ON(!d_unhashed(result));
	iput(inode);
	return result;
}

Linus Torvalds's avatar
Linus Torvalds committed
1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422
EXPORT_SYMBOL(d_instantiate_unique);

/**
 * d_alloc_root - allocate root dentry
 * @root_inode: inode to allocate the root for
 *
 * Allocate a root ("/") dentry for the inode given. The inode is
 * instantiated and returned. %NULL is returned if there is insufficient
 * memory or the inode passed is %NULL.
 */
 
struct dentry * d_alloc_root(struct inode * root_inode)
{
	struct dentry *res = NULL;

	if (root_inode) {
		static const struct qstr name = { .name = "/", .len = 1 };

		res = d_alloc(NULL, &name);
		if (res) {
			res->d_sb = root_inode->i_sb;
			res->d_parent = res;
			d_instantiate(res, root_inode);
		}
	}
	return res;
}
1423
EXPORT_SYMBOL(d_alloc_root);
Linus Torvalds's avatar
Linus Torvalds committed
1424 1425 1426 1427 1428 1429 1430 1431 1432

static inline struct hlist_head *d_hash(struct dentry *parent,
					unsigned long hash)
{
	hash += ((unsigned long) parent ^ GOLDEN_RATIO_PRIME) / L1_CACHE_BYTES;
	hash = hash ^ ((hash ^ GOLDEN_RATIO_PRIME) >> D_HASHBITS);
	return dentry_hashtable + (hash & D_HASHMASK);
}

1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445
/**
 * d_obtain_alias - find or allocate a dentry for a given inode
 * @inode: inode to allocate the dentry for
 *
 * Obtain a dentry for an inode resulting from NFS filehandle conversion or
 * similar open by handle operations.  The returned dentry may be anonymous,
 * or may have a full name (if the inode was already in the cache).
 *
 * When called on a directory inode, we must ensure that the inode only ever
 * has one dentry.  If a dentry is found, that is returned instead of
 * allocating a new one.
 *
 * On successful return, the reference to the inode has been transferred
1446 1447 1448 1449
 * to the dentry.  In case of an error the reference on the inode is released.
 * To make it easier to use in export operations a %NULL or IS_ERR inode may
 * be passed in and will be the error will be propagate to the return value,
 * with a %NULL @inode replaced by ERR_PTR(-ESTALE).
1450 1451 1452
 */
struct dentry *d_obtain_alias(struct inode *inode)
{
1453 1454 1455
	static const struct qstr anonstring = { .name = "" };
	struct dentry *tmp;
	struct dentry *res;
1456 1457

	if (!inode)
1458
		return ERR_PTR(-ESTALE);
1459 1460 1461
	if (IS_ERR(inode))
		return ERR_CAST(inode);

1462 1463 1464 1465 1466 1467 1468 1469
	res = d_find_alias(inode);
	if (res)
		goto out_iput;

	tmp = d_alloc(NULL, &anonstring);
	if (!tmp) {
		res = ERR_PTR(-ENOMEM);
		goto out_iput;
1470
	}
1471 1472 1473
	tmp->d_parent = tmp; /* make sure dput doesn't croak */

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1474
	spin_lock(&dcache_inode_lock);
1475 1476
	res = __d_find_alias(inode, 0);
	if (res) {
Nick Piggin's avatar
Nick Piggin committed
1477
		spin_unlock(&dcache_inode_lock);
1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489
		spin_unlock(&dcache_lock);
		dput(tmp);
		goto out_iput;
	}

	/* attach a disconnected dentry */
	spin_lock(&tmp->d_lock);
	tmp->d_sb = inode->i_sb;
	tmp->d_inode = inode;
	tmp->d_flags |= DCACHE_DISCONNECTED;
	tmp->d_flags &= ~DCACHE_UNHASHED;
	list_add(&tmp->d_alias, &inode->i_dentry);
Nick Piggin's avatar
Nick Piggin committed
1490
	spin_lock(&dcache_hash_lock);
1491
	hlist_add_head(&tmp->d_hash, &inode->i_sb->s_anon);
Nick Piggin's avatar
Nick Piggin committed
1492
	spin_unlock(&dcache_hash_lock);
1493
	spin_unlock(&tmp->d_lock);
Nick Piggin's avatar
Nick Piggin committed
1494
	spin_unlock(&dcache_inode_lock);
1495 1496 1497 1498 1499 1500 1501

	spin_unlock(&dcache_lock);
	return tmp;

 out_iput:
	iput(inode);
	return res;
1502
}
1503
EXPORT_SYMBOL(d_obtain_alias);
Linus Torvalds's avatar
Linus Torvalds committed
1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524

/**
 * d_splice_alias - splice a disconnected dentry into the tree if one exists
 * @inode:  the inode which may have a disconnected dentry
 * @dentry: a negative dentry which we want to point to the inode.
 *
 * If inode is a directory and has a 'disconnected' dentry (i.e. IS_ROOT and
 * DCACHE_DISCONNECTED), then d_move that in place of the given dentry
 * and return it, else simply d_add the inode to the dentry and return NULL.
 *
 * This is needed in the lookup routine of any filesystem that is exportable
 * (via knfsd) so that we can build dcache paths to directories effectively.
 *
 * If a dentry was found and moved, then it is returned.  Otherwise NULL
 * is returned.  This matches the expected return value of ->lookup.
 *
 */
struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry)
{
	struct dentry *new = NULL;

1525
	if (inode && S_ISDIR(inode->i_mode)) {
Linus Torvalds's avatar
Linus Torvalds committed
1526
		spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1527
		spin_lock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1528 1529 1530
		new = __d_find_alias(inode, 1);
		if (new) {
			BUG_ON(!(new->d_flags & DCACHE_DISCONNECTED));
Nick Piggin's avatar
Nick Piggin committed
1531
			spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1532 1533 1534 1535 1536
			spin_unlock(&dcache_lock);
			security_d_instantiate(new, inode);
			d_move(new, dentry);
			iput(inode);
		} else {
1537 1538
			/* already taking dcache_lock, so d_add() by hand */
			__d_instantiate(dentry, inode);
Nick Piggin's avatar
Nick Piggin committed
1539
			spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1540 1541 1542 1543 1544 1545 1546 1547
			spin_unlock(&dcache_lock);
			security_d_instantiate(dentry, inode);
			d_rehash(dentry);
		}
	} else
		d_add(dentry, inode);
	return new;
}
1548
EXPORT_SYMBOL(d_splice_alias);
Linus Torvalds's avatar
Linus Torvalds committed
1549

1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565
/**
 * d_add_ci - lookup or allocate new dentry with case-exact name
 * @inode:  the inode case-insensitive lookup has found
 * @dentry: the negative dentry that was passed to the parent's lookup func
 * @name:   the case-exact name to be associated with the returned dentry
 *
 * This is to avoid filling the dcache with case-insensitive names to the
 * same inode, only the actual correct case is stored in the dcache for
 * case-insensitive filesystems.
 *
 * For a case-insensitive lookup match and if the the case-exact dentry
 * already exists in in the dcache, use it and return it.
 *
 * If no entry exists with the exact case name, allocate new dentry with
 * the exact case, and return the spliced entry.
 */
1566
struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode,
1567 1568 1569 1570 1571 1572
			struct qstr *name)
{
	int error;
	struct dentry *found;
	struct dentry *new;

Christoph Hellwig's avatar
Christoph Hellwig committed
1573 1574 1575 1576
	/*
	 * First check if a dentry matching the name already exists,
	 * if not go ahead and create it now.
	 */
1577 1578 1579 1580 1581 1582 1583
	found = d_hash_and_lookup(dentry->d_parent, name);
	if (!found) {
		new = d_alloc(dentry->d_parent, name);
		if (!new) {
			error = -ENOMEM;
			goto err_out;
		}
Christoph Hellwig's avatar
Christoph Hellwig committed
1584

1585 1586 1587 1588 1589 1590 1591
		found = d_splice_alias(inode, new);
		if (found) {
			dput(new);
			return found;
		}
		return new;
	}
Christoph Hellwig's avatar
Christoph Hellwig committed
1592 1593 1594 1595 1596 1597 1598

	/*
	 * If a matching dentry exists, and it's not negative use it.
	 *
	 * Decrement the reference count to balance the iget() done
	 * earlier on.
	 */
1599 1600 1601 1602 1603 1604 1605 1606 1607
	if (found->d_inode) {
		if (unlikely(found->d_inode != inode)) {
			/* This can't happen because bad inodes are unhashed. */
			BUG_ON(!is_bad_inode(inode));
			BUG_ON(!is_bad_inode(found->d_inode));
		}
		iput(inode);
		return found;
	}
Christoph Hellwig's avatar
Christoph Hellwig committed
1608

1609 1610
	/*
	 * Negative dentry: instantiate it unless the inode is a directory and
Christoph Hellwig's avatar
Christoph Hellwig committed
1611
	 * already has a dentry.
1612 1613
	 */
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1614
	spin_lock(&dcache_inode_lock);
Christoph Hellwig's avatar
Christoph Hellwig committed
1615
	if (!S_ISDIR(inode->i_mode) || list_empty(&inode->i_dentry)) {
1616
		__d_instantiate(found, inode);
Nick Piggin's avatar
Nick Piggin committed
1617
		spin_unlock(&dcache_inode_lock);
1618 1619 1620 1621
		spin_unlock(&dcache_lock);
		security_d_instantiate(found, inode);
		return found;
	}
Christoph Hellwig's avatar
Christoph Hellwig committed
1622

1623
	/*
Christoph Hellwig's avatar
Christoph Hellwig committed
1624 1625
	 * In case a directory already has a (disconnected) entry grab a
	 * reference to it, move it in place and use it.
1626 1627 1628
	 */
	new = list_entry(inode->i_dentry.next, struct dentry, d_alias);
	dget_locked(new);
Nick Piggin's avatar
Nick Piggin committed
1629
	spin_unlock(&dcache_inode_lock);
1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640
	spin_unlock(&dcache_lock);
	security_d_instantiate(found, inode);
	d_move(new, found);
	iput(inode);
	dput(found);
	return new;

err_out:
	iput(inode);
	return ERR_PTR(error);
}
1641
EXPORT_SYMBOL(d_add_ci);
Linus Torvalds's avatar
Linus Torvalds committed
1642 1643 1644 1645 1646

/**
 * d_lookup - search for a dentry
 * @parent: parent dentry
 * @name: qstr of name we wish to find
1647
 * Returns: dentry, or NULL
Linus Torvalds's avatar
Linus Torvalds committed
1648
 *
1649 1650 1651 1652
 * d_lookup searches the children of the parent dentry for the name in
 * question. If the dentry is found its reference count is incremented and the
 * dentry is returned. The caller must use dput to free the entry when it has
 * finished using it. %NULL is returned if the dentry does not exist.
Linus Torvalds's avatar
Linus Torvalds committed
1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666
 */
struct dentry * d_lookup(struct dentry * parent, struct qstr * name)
{
	struct dentry * dentry = NULL;
	unsigned long seq;

        do {
                seq = read_seqbegin(&rename_lock);
                dentry = __d_lookup(parent, name);
                if (dentry)
			break;
	} while (read_seqretry(&rename_lock, seq));
	return dentry;
}
1667
EXPORT_SYMBOL(d_lookup);
Linus Torvalds's avatar
Linus Torvalds committed
1668

1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683
/*
 * __d_lookup - search for a dentry (racy)
 * @parent: parent dentry
 * @name: qstr of name we wish to find
 * Returns: dentry, or NULL
 *
 * __d_lookup is like d_lookup, however it may (rarely) return a
 * false-negative result due to unrelated rename activity.
 *
 * __d_lookup is slightly faster by avoiding rename_lock read seqlock,
 * however it must be used carefully, eg. with a following d_lookup in
 * the case of failure.
 *
 * __d_lookup callers must be commented.
 */
Linus Torvalds's avatar
Linus Torvalds committed
1684 1685 1686 1687 1688 1689 1690 1691
struct dentry * __d_lookup(struct dentry * parent, struct qstr * name)
{
	unsigned int len = name->len;
	unsigned int hash = name->hash;
	const unsigned char *str = name->name;
	struct hlist_head *head = d_hash(parent,hash);
	struct dentry *found = NULL;
	struct hlist_node *node;
1692
	struct dentry *dentry;
Linus Torvalds's avatar
Linus Torvalds committed
1693

1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706
	/*
	 * The hash list is protected using RCU.
	 *
	 * Take d_lock when comparing a candidate dentry, to avoid races
	 * with d_move().
	 *
	 * It is possible that concurrent renames can mess up our list
	 * walk here and result in missing our dentry, resulting in the
	 * false-negative result. d_lookup() protects against concurrent
	 * renames using rename_lock seqlock.
	 *
	 * See Documentation/vfs/dcache-locking.txt for more details.
	 */
Linus Torvalds's avatar
Linus Torvalds committed
1707 1708
	rcu_read_lock();
	
1709
	hlist_for_each_entry_rcu(dentry, node, head, d_hash) {
Linus Torvalds's avatar
Linus Torvalds committed
1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
		struct qstr *qstr;

		if (dentry->d_name.hash != hash)
			continue;
		if (dentry->d_parent != parent)
			continue;

		spin_lock(&dentry->d_lock);

		/*
		 * Recheck the dentry after taking the lock - d_move may have
1721 1722
		 * changed things. Don't bother checking the hash because
		 * we're about to compare the whole name anyway.
Linus Torvalds's avatar
Linus Torvalds committed
1723 1724 1725 1726
		 */
		if (dentry->d_parent != parent)
			goto next;

1727 1728 1729 1730
		/* non-existing due to RCU? */
		if (d_unhashed(dentry))
			goto next;

Linus Torvalds's avatar
Linus Torvalds committed
1731 1732 1733 1734 1735 1736
		/*
		 * It is safe to compare names since d_move() cannot
		 * change the qstr (protected by d_lock).
		 */
		qstr = &dentry->d_name;
		if (parent->d_op && parent->d_op->d_compare) {
1737 1738 1739
			if (parent->d_op->d_compare(parent, parent->d_inode,
						dentry, dentry->d_inode,
						qstr->len, qstr->name, name))
Linus Torvalds's avatar
Linus Torvalds committed
1740 1741 1742 1743 1744 1745 1746 1747
				goto next;
		} else {
			if (qstr->len != len)
				goto next;
			if (memcmp(qstr->name, str, len))
				goto next;
		}

1748
		dentry->d_count++;
1749
		found = dentry;
Linus Torvalds's avatar
Linus Torvalds committed
1750 1751 1752 1753 1754 1755 1756 1757 1758 1759
		spin_unlock(&dentry->d_lock);
		break;
next:
		spin_unlock(&dentry->d_lock);
 	}
 	rcu_read_unlock();

 	return found;
}

1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777
/**
 * d_hash_and_lookup - hash the qstr then search for a dentry
 * @dir: Directory to search in
 * @name: qstr of name we wish to find
 *
 * On hash failure or on lookup failure NULL is returned.
 */
struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name)
{
	struct dentry *dentry = NULL;

	/*
	 * Check for a fs-specific hash function. Note that we must
	 * calculate the standard hash first, as the d_op->d_hash()
	 * routine may choose to leave the hash value unchanged.
	 */
	name->hash = full_name_hash(name->name, name->len);
	if (dir->d_op && dir->d_op->d_hash) {
Nick Piggin's avatar
Nick Piggin committed
1778
		if (dir->d_op->d_hash(dir, dir->d_inode, name) < 0)
1779 1780 1781 1782 1783 1784 1785
			goto out;
	}
	dentry = d_lookup(dir, name);
out:
	return dentry;
}

Linus Torvalds's avatar
Linus Torvalds committed
1786
/**
Nick Piggin's avatar
Nick Piggin committed
1787
 * d_validate - verify dentry provided from insecure source (deprecated)
Linus Torvalds's avatar
Linus Torvalds committed
1788 1789 1790 1791 1792 1793
 * @dentry: The dentry alleged to be valid child of @dparent
 * @dparent: The parent dentry (known to be valid)
 *
 * An insecure source has sent us a dentry, here we verify it and dget() it.
 * This is used by ncpfs in its readdir implementation.
 * Zero is returned in the dentry is invalid.
Nick Piggin's avatar
Nick Piggin committed
1794 1795
 *
 * This function is slow for big directories, and deprecated, do not use it.
Linus Torvalds's avatar
Linus Torvalds committed
1796
 */
1797
int d_validate(struct dentry *dentry, struct dentry *dparent)
Linus Torvalds's avatar
Linus Torvalds committed
1798
{
Nick Piggin's avatar
Nick Piggin committed
1799
	struct dentry *child;
1800 1801

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1802
	spin_lock(&dparent->d_lock);
Nick Piggin's avatar
Nick Piggin committed
1803 1804
	list_for_each_entry(child, &dparent->d_subdirs, d_u.d_child) {
		if (dentry == child) {
Nick Piggin's avatar
Nick Piggin committed
1805 1806 1807 1808
			spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
			__dget_locked_dlock(dentry);
			spin_unlock(&dentry->d_lock);
			spin_unlock(&dparent->d_lock);
1809
			spin_unlock(&dcache_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1810 1811 1812
			return 1;
		}
	}
Nick Piggin's avatar
Nick Piggin committed
1813
	spin_unlock(&dparent->d_lock);
1814
	spin_unlock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1815

Linus Torvalds's avatar
Linus Torvalds committed
1816 1817
	return 0;
}
1818
EXPORT_SYMBOL(d_validate);
Linus Torvalds's avatar
Linus Torvalds committed
1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842

/*
 * When a file is deleted, we have two options:
 * - turn this dentry into a negative dentry
 * - unhash this dentry and free it.
 *
 * Usually, we want to just turn this into
 * a negative dentry, but if anybody else is
 * currently using the dentry or the inode
 * we can't do that and we fall back on removing
 * it from the hash queues and waiting for
 * it to be deleted later when it has no users
 */
 
/**
 * d_delete - delete a dentry
 * @dentry: The dentry to delete
 *
 * Turn the dentry into a negative dentry if possible, otherwise
 * remove it from the hash queues so it can be deleted later
 */
 
void d_delete(struct dentry * dentry)
{
1843
	int isdir = 0;
Linus Torvalds's avatar
Linus Torvalds committed
1844 1845 1846 1847
	/*
	 * Are we the only user?
	 */
	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
1848
	spin_lock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1849
	spin_lock(&dentry->d_lock);
1850
	isdir = S_ISDIR(dentry->d_inode->i_mode);
1851
	if (dentry->d_count == 1) {
1852
		dentry->d_flags &= ~DCACHE_CANT_MOUNT;
Linus Torvalds's avatar
Linus Torvalds committed
1853
		dentry_iput(dentry);
1854
		fsnotify_nameremove(dentry, isdir);
Linus Torvalds's avatar
Linus Torvalds committed
1855 1856 1857 1858 1859 1860 1861
		return;
	}

	if (!d_unhashed(dentry))
		__d_drop(dentry);

	spin_unlock(&dentry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
1862
	spin_unlock(&dcache_inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1863
	spin_unlock(&dcache_lock);
1864 1865

	fsnotify_nameremove(dentry, isdir);
Linus Torvalds's avatar
Linus Torvalds committed
1866
}
1867
EXPORT_SYMBOL(d_delete);
Linus Torvalds's avatar
Linus Torvalds committed
1868 1869 1870 1871 1872 1873 1874 1875

static void __d_rehash(struct dentry * entry, struct hlist_head *list)
{

 	entry->d_flags &= ~DCACHE_UNHASHED;
 	hlist_add_head_rcu(&entry->d_hash, list);
}

1876 1877 1878 1879 1880
static void _d_rehash(struct dentry * entry)
{
	__d_rehash(entry, d_hash(entry->d_parent, entry->d_name.hash));
}

Linus Torvalds's avatar
Linus Torvalds committed
1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891
/**
 * d_rehash	- add an entry back to the hash
 * @entry: dentry to add to the hash
 *
 * Adds a dentry to the hash according to its name.
 */
 
void d_rehash(struct dentry * entry)
{
	spin_lock(&dcache_lock);
	spin_lock(&entry->d_lock);
Nick Piggin's avatar
Nick Piggin committed
1892
	spin_lock(&dcache_hash_lock);
1893
	_d_rehash(entry);
Nick Piggin's avatar
Nick Piggin committed
1894
	spin_unlock(&dcache_hash_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1895 1896 1897
	spin_unlock(&entry->d_lock);
	spin_unlock(&dcache_lock);
}
1898
EXPORT_SYMBOL(d_rehash);
Linus Torvalds's avatar
Linus Torvalds committed
1899

Nick Piggin's avatar
Nick Piggin committed
1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926
/**
 * dentry_update_name_case - update case insensitive dentry with a new name
 * @dentry: dentry to be updated
 * @name: new name
 *
 * Update a case insensitive dentry with new case of name.
 *
 * dentry must have been returned by d_lookup with name @name. Old and new
 * name lengths must match (ie. no d_compare which allows mismatched name
 * lengths).
 *
 * Parent inode i_mutex must be held over d_lookup and into this call (to
 * keep renames and concurrent inserts, and readdir(2) away).
 */
void dentry_update_name_case(struct dentry *dentry, struct qstr *name)
{
	BUG_ON(!mutex_is_locked(&dentry->d_inode->i_mutex));
	BUG_ON(dentry->d_name.len != name->len); /* d_lookup gives this */

	spin_lock(&dcache_lock);
	spin_lock(&dentry->d_lock);
	memcpy((unsigned char *)dentry->d_name.name, name->name, name->len);
	spin_unlock(&dentry->d_lock);
	spin_unlock(&dcache_lock);
}
EXPORT_SYMBOL(dentry_update_name_case);

Linus Torvalds's avatar
Linus Torvalds committed
1927 1928 1929 1930 1931 1932 1933
static void switch_names(struct dentry *dentry, struct dentry *target)
{
	if (dname_external(target)) {
		if (dname_external(dentry)) {
			/*
			 * Both external: swap the pointers
			 */
1934
			swap(target->d_name.name, dentry->d_name.name);
Linus Torvalds's avatar
Linus Torvalds committed
1935 1936 1937 1938 1939
		} else {
			/*
			 * dentry:internal, target:external.  Steal target's
			 * storage and make target internal.
			 */
1940 1941
			memcpy(target->d_iname, dentry->d_name.name,
					dentry->d_name.len + 1);
Linus Torvalds's avatar
Linus Torvalds committed
1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960
			dentry->d_name.name = target->d_name.name;
			target->d_name.name = target->d_iname;
		}
	} else {
		if (dname_external(dentry)) {
			/*
			 * dentry:external, target:internal.  Give dentry's
			 * storage to target and make dentry internal
			 */
			memcpy(dentry->d_iname, target->d_name.name,
					target->d_name.len + 1);
			target->d_name.name = dentry->d_name.name;
			dentry->d_name.name = dentry->d_iname;
		} else {
			/*
			 * Both are internal.  Just copy target to dentry
			 */
			memcpy(dentry->d_iname, target->d_name.name,
					target->d_name.len + 1);
1961 1962
			dentry->d_name.len = target->d_name.len;
			return;
Linus Torvalds's avatar
Linus Torvalds committed
1963 1964
		}
	}
1965
	swap(dentry->d_name.len, target->d_name.len);
Linus Torvalds's avatar
Linus Torvalds committed
1966 1967
}

Nick Piggin's avatar
Nick Piggin committed
1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003
static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target)
{
	/*
	 * XXXX: do we really need to take target->d_lock?
	 */
	if (IS_ROOT(dentry) || dentry->d_parent == target->d_parent)
		spin_lock(&target->d_parent->d_lock);
	else {
		if (d_ancestor(dentry->d_parent, target->d_parent)) {
			spin_lock(&dentry->d_parent->d_lock);
			spin_lock_nested(&target->d_parent->d_lock,
						DENTRY_D_LOCK_NESTED);
		} else {
			spin_lock(&target->d_parent->d_lock);
			spin_lock_nested(&dentry->d_parent->d_lock,
						DENTRY_D_LOCK_NESTED);
		}
	}
	if (target < dentry) {
		spin_lock_nested(&target->d_lock, 2);
		spin_lock_nested(&dentry->d_lock, 3);
	} else {
		spin_lock_nested(&dentry->d_lock, 2);
		spin_lock_nested(&target->d_lock, 3);
	}
}

static void dentry_unlock_parents_for_move(struct dentry *dentry,
					struct dentry *target)
{
	if (target->d_parent != dentry->d_parent)
		spin_unlock(&dentry->d_parent->d_lock);
	if (target->d_parent != target)
		spin_unlock(&target->d_parent->d_lock);
}

Linus Torvalds's avatar
Linus Torvalds committed
2004
/*
Nick Piggin's avatar
Nick Piggin committed
2005 2006 2007 2008 2009 2010 2011 2012 2013
 * When switching names, the actual string doesn't strictly have to
 * be preserved in the target - because we're dropping the target
 * anyway. As such, we can just do a simple memcpy() to copy over
 * the new name before we switch.
 *
 * Note that we have to be a lot more careful about getting the hash
 * switched - we have to switch the hash value properly even if it
 * then no longer matches the actual (corrupted) string of the target.
 * The hash value has to match the hash queue that the dentry is on..
Linus Torvalds's avatar
Linus Torvalds committed
2014
 */
2015 2016
/*
 * d_move_locked - move a dentry
Linus Torvalds's avatar
Linus Torvalds committed
2017 2018 2019 2020 2021 2022
 * @dentry: entry to move
 * @target: new dentry
 *
 * Update the dcache to reflect the move of a file name. Negative
 * dcache entries should not be moved in this way.
 */
2023
static void d_move_locked(struct dentry * dentry, struct dentry * target)
Linus Torvalds's avatar
Linus Torvalds committed
2024 2025 2026 2027
{
	if (!dentry->d_inode)
		printk(KERN_WARNING "VFS: moving negative dcache entry\n");

Nick Piggin's avatar
Nick Piggin committed
2028 2029 2030
	BUG_ON(d_ancestor(dentry, target));
	BUG_ON(d_ancestor(target, dentry));

Linus Torvalds's avatar
Linus Torvalds committed
2031
	write_seqlock(&rename_lock);
Nick Piggin's avatar
Nick Piggin committed
2032 2033

	dentry_lock_for_move(dentry, target);
Linus Torvalds's avatar
Linus Torvalds committed
2034 2035

	/* Move the dentry to the target hash queue, if on different bucket */
Nick Piggin's avatar
Nick Piggin committed
2036 2037 2038 2039 2040
	spin_lock(&dcache_hash_lock);
	if (!d_unhashed(dentry))
		hlist_del_rcu(&dentry->d_hash);
	__d_rehash(dentry, d_hash(target->d_parent, target->d_name.hash));
	spin_unlock(&dcache_hash_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2041 2042 2043 2044

	/* Unhash the target: dput() will then get rid of it */
	__d_drop(target);

Eric Dumazet's avatar
Eric Dumazet committed
2045 2046
	list_del(&dentry->d_u.d_child);
	list_del(&target->d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
2047 2048 2049

	/* Switch the names.. */
	switch_names(dentry, target);
2050
	swap(dentry->d_name.hash, target->d_name.hash);
Linus Torvalds's avatar
Linus Torvalds committed
2051 2052 2053 2054 2055

	/* ... and switch the parents */
	if (IS_ROOT(dentry)) {
		dentry->d_parent = target->d_parent;
		target->d_parent = target;
Eric Dumazet's avatar
Eric Dumazet committed
2056
		INIT_LIST_HEAD(&target->d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
2057
	} else {
2058
		swap(dentry->d_parent, target->d_parent);
Linus Torvalds's avatar
Linus Torvalds committed
2059 2060

		/* And add them back to the (new) parent lists */
Eric Dumazet's avatar
Eric Dumazet committed
2061
		list_add(&target->d_u.d_child, &target->d_parent->d_subdirs);
Linus Torvalds's avatar
Linus Torvalds committed
2062 2063
	}

Eric Dumazet's avatar
Eric Dumazet committed
2064
	list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
Nick Piggin's avatar
Nick Piggin committed
2065 2066

	dentry_unlock_parents_for_move(dentry, target);
Linus Torvalds's avatar
Linus Torvalds committed
2067
	spin_unlock(&target->d_lock);
2068
	fsnotify_d_move(dentry);
Linus Torvalds's avatar
Linus Torvalds committed
2069 2070
	spin_unlock(&dentry->d_lock);
	write_sequnlock(&rename_lock);
2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085
}

/**
 * d_move - move a dentry
 * @dentry: entry to move
 * @target: new dentry
 *
 * Update the dcache to reflect the move of a file name. Negative
 * dcache entries should not be moved in this way.
 */

void d_move(struct dentry * dentry, struct dentry * target)
{
	spin_lock(&dcache_lock);
	d_move_locked(dentry, target);
Linus Torvalds's avatar
Linus Torvalds committed
2086 2087
	spin_unlock(&dcache_lock);
}
2088
EXPORT_SYMBOL(d_move);
Linus Torvalds's avatar
Linus Torvalds committed
2089

2090 2091 2092 2093 2094 2095 2096
/**
 * d_ancestor - search for an ancestor
 * @p1: ancestor dentry
 * @p2: child dentry
 *
 * Returns the ancestor dentry of p2 which is a child of p1, if p1 is
 * an ancestor of p2, else NULL.
2097
 */
2098
struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2)
2099 2100 2101
{
	struct dentry *p;

2102
	for (p = p2; !IS_ROOT(p); p = p->d_parent) {
2103
		if (p->d_parent == p1)
2104
			return p;
2105
	}
2106
	return NULL;
2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118
}

/*
 * This helper attempts to cope with remotely renamed directories
 *
 * It assumes that the caller is already holding
 * dentry->d_parent->d_inode->i_mutex and the dcache_lock
 *
 * Note: If ever the locking in lock_rename() changes, then please
 * remember to update this too...
 */
static struct dentry *__d_unalias(struct dentry *dentry, struct dentry *alias)
2119
	__releases(dcache_lock)
Nick Piggin's avatar
Nick Piggin committed
2120
	__releases(dcache_inode_lock)
2121 2122 2123 2124 2125 2126 2127 2128 2129 2130
{
	struct mutex *m1 = NULL, *m2 = NULL;
	struct dentry *ret;

	/* If alias and dentry share a parent, then no extra locks required */
	if (alias->d_parent == dentry->d_parent)
		goto out_unalias;

	/* Check for loops */
	ret = ERR_PTR(-ELOOP);
2131
	if (d_ancestor(alias, dentry))
2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145
		goto out_err;

	/* See lock_rename() */
	ret = ERR_PTR(-EBUSY);
	if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex))
		goto out_err;
	m1 = &dentry->d_sb->s_vfs_rename_mutex;
	if (!mutex_trylock(&alias->d_parent->d_inode->i_mutex))
		goto out_err;
	m2 = &alias->d_parent->d_inode->i_mutex;
out_unalias:
	d_move_locked(alias, dentry);
	ret = alias;
out_err:
Nick Piggin's avatar
Nick Piggin committed
2146
	spin_unlock(&dcache_inode_lock);
2147 2148 2149 2150 2151 2152 2153 2154
	spin_unlock(&dcache_lock);
	if (m2)
		mutex_unlock(m2);
	if (m1)
		mutex_unlock(m1);
	return ret;
}

2155 2156 2157
/*
 * Prepare an anonymous dentry for life in the superblock's dentry tree as a
 * named dentry in place of the dentry to be replaced.
Nick Piggin's avatar
Nick Piggin committed
2158
 * returns with anon->d_lock held!
2159 2160 2161 2162 2163
 */
static void __d_materialise_dentry(struct dentry *dentry, struct dentry *anon)
{
	struct dentry *dparent, *aparent;

Nick Piggin's avatar
Nick Piggin committed
2164
	dentry_lock_for_move(anon, dentry);
2165 2166 2167 2168

	dparent = dentry->d_parent;
	aparent = anon->d_parent;

Nick Piggin's avatar
Nick Piggin committed
2169 2170 2171
	switch_names(dentry, anon);
	swap(dentry->d_name.hash, anon->d_name.hash);

2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185
	dentry->d_parent = (aparent == anon) ? dentry : aparent;
	list_del(&dentry->d_u.d_child);
	if (!IS_ROOT(dentry))
		list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs);
	else
		INIT_LIST_HEAD(&dentry->d_u.d_child);

	anon->d_parent = (dparent == dentry) ? anon : dparent;
	list_del(&anon->d_u.d_child);
	if (!IS_ROOT(anon))
		list_add(&anon->d_u.d_child, &anon->d_parent->d_subdirs);
	else
		INIT_LIST_HEAD(&anon->d_u.d_child);

Nick Piggin's avatar
Nick Piggin committed
2186 2187 2188 2189
	dentry_unlock_parents_for_move(anon, dentry);
	spin_unlock(&dentry->d_lock);

	/* anon->d_lock still locked, returns locked */
2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202
	anon->d_flags &= ~DCACHE_DISCONNECTED;
}

/**
 * d_materialise_unique - introduce an inode into the tree
 * @dentry: candidate dentry
 * @inode: inode to bind to the dentry, to which aliases may be attached
 *
 * Introduces an dentry into the tree, substituting an extant disconnected
 * root directory alias in its place if there is one
 */
struct dentry *d_materialise_unique(struct dentry *dentry, struct inode *inode)
{
2203
	struct dentry *actual;
2204 2205 2206 2207

	BUG_ON(!d_unhashed(dentry));

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
2208
	spin_lock(&dcache_inode_lock);
2209 2210 2211

	if (!inode) {
		actual = dentry;
2212
		__d_instantiate(dentry, NULL);
2213 2214 2215
		goto found_lock;
	}

2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235
	if (S_ISDIR(inode->i_mode)) {
		struct dentry *alias;

		/* Does an aliased dentry already exist? */
		alias = __d_find_alias(inode, 0);
		if (alias) {
			actual = alias;
			/* Is this an anonymous mountpoint that we could splice
			 * into our tree? */
			if (IS_ROOT(alias)) {
				__d_materialise_dentry(dentry, alias);
				__d_drop(alias);
				goto found;
			}
			/* Nope, but we must(!) avoid directory aliasing */
			actual = __d_unalias(dentry, alias);
			if (IS_ERR(actual))
				dput(alias);
			goto out_nolock;
		}
2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247
	}

	/* Add a unique reference */
	actual = __d_instantiate_unique(dentry, inode);
	if (!actual)
		actual = dentry;
	else if (unlikely(!d_unhashed(actual)))
		goto shouldnt_be_hashed;

found_lock:
	spin_lock(&actual->d_lock);
found:
Nick Piggin's avatar
Nick Piggin committed
2248
	spin_lock(&dcache_hash_lock);
2249
	_d_rehash(actual);
Nick Piggin's avatar
Nick Piggin committed
2250
	spin_unlock(&dcache_hash_lock);
2251
	spin_unlock(&actual->d_lock);
Nick Piggin's avatar
Nick Piggin committed
2252
	spin_unlock(&dcache_inode_lock);
2253
	spin_unlock(&dcache_lock);
2254
out_nolock:
2255 2256 2257 2258 2259 2260 2261 2262 2263
	if (actual == dentry) {
		security_d_instantiate(dentry, inode);
		return NULL;
	}

	iput(inode);
	return actual;

shouldnt_be_hashed:
Nick Piggin's avatar
Nick Piggin committed
2264
	spin_unlock(&dcache_inode_lock);
2265 2266 2267
	spin_unlock(&dcache_lock);
	BUG();
}
2268
EXPORT_SYMBOL_GPL(d_materialise_unique);
2269

2270
static int prepend(char **buffer, int *buflen, const char *str, int namelen)
2271 2272 2273 2274 2275 2276 2277 2278 2279
{
	*buflen -= namelen;
	if (*buflen < 0)
		return -ENAMETOOLONG;
	*buffer -= namelen;
	memcpy(*buffer, str, namelen);
	return 0;
}

2280 2281 2282 2283 2284
static int prepend_name(char **buffer, int *buflen, struct qstr *name)
{
	return prepend(buffer, buflen, name->name, name->len);
}

Linus Torvalds's avatar
Linus Torvalds committed
2285
/**
2286 2287
 * Prepend path string to a buffer
 *
2288 2289
 * @path: the dentry/vfsmount to report
 * @root: root vfsmnt/dentry (may be modified by this function)
2290 2291
 * @buffer: pointer to the end of the buffer
 * @buflen: pointer to buffer length
2292
 *
2293
 * Caller holds the dcache_lock.
2294 2295 2296
 *
 * If path is not reachable from the supplied root, then the value of
 * root is changed (without modifying refcounts).
Linus Torvalds's avatar
Linus Torvalds committed
2297
 */
2298 2299
static int prepend_path(const struct path *path, struct path *root,
			char **buffer, int *buflen)
Linus Torvalds's avatar
Linus Torvalds committed
2300
{
2301 2302
	struct dentry *dentry = path->dentry;
	struct vfsmount *vfsmnt = path->mnt;
2303 2304
	bool slash = false;
	int error = 0;
2305

Nick Piggin's avatar
Nick Piggin committed
2306
	br_read_lock(vfsmount_lock);
2307
	while (dentry != root->dentry || vfsmnt != root->mnt) {
Linus Torvalds's avatar
Linus Torvalds committed
2308 2309 2310
		struct dentry * parent;

		if (dentry == vfsmnt->mnt_root || IS_ROOT(dentry)) {
2311
			/* Global root? */
Linus Torvalds's avatar
Linus Torvalds committed
2312 2313 2314 2315 2316 2317 2318 2319 2320
			if (vfsmnt->mnt_parent == vfsmnt) {
				goto global_root;
			}
			dentry = vfsmnt->mnt_mountpoint;
			vfsmnt = vfsmnt->mnt_parent;
			continue;
		}
		parent = dentry->d_parent;
		prefetch(parent);
2321
		spin_lock(&dentry->d_lock);
2322
		error = prepend_name(buffer, buflen, &dentry->d_name);
2323
		spin_unlock(&dentry->d_lock);
2324 2325 2326 2327 2328 2329
		if (!error)
			error = prepend(buffer, buflen, "/", 1);
		if (error)
			break;

		slash = true;
Linus Torvalds's avatar
Linus Torvalds committed
2330 2331 2332
		dentry = parent;
	}

2333
out:
2334 2335 2336
	if (!error && !slash)
		error = prepend(buffer, buflen, "/", 1);

Nick Piggin's avatar
Nick Piggin committed
2337
	br_read_unlock(vfsmount_lock);
2338
	return error;
Linus Torvalds's avatar
Linus Torvalds committed
2339 2340

global_root:
2341 2342 2343 2344 2345 2346 2347 2348 2349
	/*
	 * Filesystems needing to implement special "root names"
	 * should do so with ->d_dname()
	 */
	if (IS_ROOT(dentry) &&
	    (dentry->d_name.len != 1 || dentry->d_name.name[0] != '/')) {
		WARN(1, "Root dentry has weird name <%.*s>\n",
		     (int) dentry->d_name.len, dentry->d_name.name);
	}
2350 2351
	root->mnt = vfsmnt;
	root->dentry = dentry;
2352
	goto out;
2353
}
2354

2355 2356 2357 2358
/**
 * __d_path - return the path of a dentry
 * @path: the dentry/vfsmount to report
 * @root: root vfsmnt/dentry (may be modified by this function)
2359
 * @buf: buffer to return value in
2360 2361
 * @buflen: buffer length
 *
2362
 * Convert a dentry into an ASCII path name.
2363 2364 2365 2366
 *
 * Returns a pointer into the buffer or an error code if the
 * path was too long.
 *
2367
 * "buflen" should be positive.
2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378
 *
 * If path is not reachable from the supplied root, then the value of
 * root is changed (without modifying refcounts).
 */
char *__d_path(const struct path *path, struct path *root,
	       char *buf, int buflen)
{
	char *res = buf + buflen;
	int error;

	prepend(&res, &buflen, "\0", 1);
2379
	spin_lock(&dcache_lock);
2380
	error = prepend_path(path, root, &res, &buflen);
2381 2382
	spin_unlock(&dcache_lock);

2383 2384 2385
	if (error)
		return ERR_PTR(error);
	return res;
Linus Torvalds's avatar
Linus Torvalds committed
2386 2387
}

2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403
/*
 * same as __d_path but appends "(deleted)" for unlinked files.
 */
static int path_with_deleted(const struct path *path, struct path *root,
				 char **buf, int *buflen)
{
	prepend(buf, buflen, "\0", 1);
	if (d_unlinked(path->dentry)) {
		int error = prepend(buf, buflen, " (deleted)", 10);
		if (error)
			return error;
	}

	return prepend_path(path, root, buf, buflen);
}

2404 2405 2406 2407 2408
static int prepend_unreachable(char **buffer, int *buflen)
{
	return prepend(buffer, buflen, "(unreachable)", 13);
}

Jan Blunck's avatar
Jan Blunck committed
2409 2410
/**
 * d_path - return the path of a dentry
2411
 * @path: path to report
Jan Blunck's avatar
Jan Blunck committed
2412 2413 2414 2415 2416 2417
 * @buf: buffer to return value in
 * @buflen: buffer length
 *
 * Convert a dentry into an ASCII path name. If the entry has been deleted
 * the string " (deleted)" is appended. Note that this is ambiguous.
 *
2418 2419 2420 2421
 * Returns a pointer into the buffer or an error code if the path was
 * too long. Note: Callers should use the returned pointer, not the passed
 * in buffer, to use the name! The implementation often starts at an offset
 * into the buffer, and may leave 0 bytes at the start.
Jan Blunck's avatar
Jan Blunck committed
2422
 *
2423
 * "buflen" should be positive.
Jan Blunck's avatar
Jan Blunck committed
2424
 */
2425
char *d_path(const struct path *path, char *buf, int buflen)
Linus Torvalds's avatar
Linus Torvalds committed
2426
{
2427
	char *res = buf + buflen;
Jan Blunck's avatar
Jan Blunck committed
2428
	struct path root;
2429
	struct path tmp;
2430
	int error;
Linus Torvalds's avatar
Linus Torvalds committed
2431

2432 2433 2434 2435 2436 2437 2438
	/*
	 * We have various synthetic filesystems that never get mounted.  On
	 * these filesystems dentries are never used for lookup purposes, and
	 * thus don't need to be hashed.  They also don't need a name until a
	 * user wants to identify the object in /proc/pid/fd/.  The little hack
	 * below allows us to generate a name for these objects on demand:
	 */
2439 2440
	if (path->dentry->d_op && path->dentry->d_op->d_dname)
		return path->dentry->d_op->d_dname(path->dentry, buf, buflen);
2441

2442
	get_fs_root(current->fs, &root);
2443
	spin_lock(&dcache_lock);
2444
	tmp = root;
2445 2446 2447
	error = path_with_deleted(path, &tmp, &res, &buflen);
	if (error)
		res = ERR_PTR(error);
2448
	spin_unlock(&dcache_lock);
Jan Blunck's avatar
Jan Blunck committed
2449
	path_put(&root);
Linus Torvalds's avatar
Linus Torvalds committed
2450 2451
	return res;
}
2452
EXPORT_SYMBOL(d_path);
Linus Torvalds's avatar
Linus Torvalds committed
2453

2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486
/**
 * d_path_with_unreachable - return the path of a dentry
 * @path: path to report
 * @buf: buffer to return value in
 * @buflen: buffer length
 *
 * The difference from d_path() is that this prepends "(unreachable)"
 * to paths which are unreachable from the current process' root.
 */
char *d_path_with_unreachable(const struct path *path, char *buf, int buflen)
{
	char *res = buf + buflen;
	struct path root;
	struct path tmp;
	int error;

	if (path->dentry->d_op && path->dentry->d_op->d_dname)
		return path->dentry->d_op->d_dname(path->dentry, buf, buflen);

	get_fs_root(current->fs, &root);
	spin_lock(&dcache_lock);
	tmp = root;
	error = path_with_deleted(path, &tmp, &res, &buflen);
	if (!error && !path_equal(&tmp, &root))
		error = prepend_unreachable(&res, &buflen);
	spin_unlock(&dcache_lock);
	path_put(&root);
	if (error)
		res =  ERR_PTR(error);

	return res;
}

2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507
/*
 * Helper function for dentry_operations.d_dname() members
 */
char *dynamic_dname(struct dentry *dentry, char *buffer, int buflen,
			const char *fmt, ...)
{
	va_list args;
	char temp[64];
	int sz;

	va_start(args, fmt);
	sz = vsnprintf(temp, sizeof(temp), fmt, args) + 1;
	va_end(args);

	if (sz > sizeof(temp) || sz > buflen)
		return ERR_PTR(-ENAMETOOLONG);

	buffer += buflen - sz;
	return memcpy(buffer, temp, sz);
}

2508 2509 2510
/*
 * Write full pathname from the root of the filesystem into the buffer.
 */
Nick Piggin's avatar
Nick Piggin committed
2511
static char *__dentry_path(struct dentry *dentry, char *buf, int buflen)
2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522
{
	char *end = buf + buflen;
	char *retval;

	prepend(&end, &buflen, "\0", 1);
	if (buflen < 1)
		goto Elong;
	/* Get '/' right */
	retval = end-1;
	*retval = '/';

2523 2524
	while (!IS_ROOT(dentry)) {
		struct dentry *parent = dentry->d_parent;
2525
		int error;
2526 2527

		prefetch(parent);
2528 2529 2530 2531
		spin_lock(&dentry->d_lock);
		error = prepend_name(&end, &buflen, &dentry->d_name);
		spin_unlock(&dentry->d_lock);
		if (error != 0 || prepend(&end, &buflen, "/", 1) != 0)
2532 2533 2534 2535 2536
			goto Elong;

		retval = end;
		dentry = parent;
	}
Al Viro's avatar
Al Viro committed
2537 2538 2539 2540
	return retval;
Elong:
	return ERR_PTR(-ENAMETOOLONG);
}
Nick Piggin's avatar
Nick Piggin committed
2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552

char *dentry_path_raw(struct dentry *dentry, char *buf, int buflen)
{
	char *retval;

	spin_lock(&dcache_lock);
	retval = __dentry_path(dentry, buf, buflen);
	spin_unlock(&dcache_lock);

	return retval;
}
EXPORT_SYMBOL(dentry_path_raw);
Al Viro's avatar
Al Viro committed
2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566

char *dentry_path(struct dentry *dentry, char *buf, int buflen)
{
	char *p = NULL;
	char *retval;

	spin_lock(&dcache_lock);
	if (d_unlinked(dentry)) {
		p = buf + buflen;
		if (prepend(&p, &buflen, "//deleted", 10) != 0)
			goto Elong;
		buflen++;
	}
	retval = __dentry_path(dentry, buf, buflen);
2567
	spin_unlock(&dcache_lock);
Al Viro's avatar
Al Viro committed
2568 2569
	if (!IS_ERR(retval) && p)
		*p = '/';	/* restore '/' overriden with '\0' */
2570 2571 2572 2573 2574 2575
	return retval;
Elong:
	spin_unlock(&dcache_lock);
	return ERR_PTR(-ENAMETOOLONG);
}

Linus Torvalds's avatar
Linus Torvalds committed
2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593
/*
 * NOTE! The user-level library version returns a
 * character pointer. The kernel system call just
 * returns the length of the buffer filled (which
 * includes the ending '\0' character), or a negative
 * error value. So libc would do something like
 *
 *	char *getcwd(char * buf, size_t size)
 *	{
 *		int retval;
 *
 *		retval = sys_getcwd(buf, size);
 *		if (retval >= 0)
 *			return buf;
 *		errno = -retval;
 *		return NULL;
 *	}
 */
2594
SYSCALL_DEFINE2(getcwd, char __user *, buf, unsigned long, size)
Linus Torvalds's avatar
Linus Torvalds committed
2595
{
2596
	int error;
Jan Blunck's avatar
Jan Blunck committed
2597
	struct path pwd, root;
2598
	char *page = (char *) __get_free_page(GFP_USER);
Linus Torvalds's avatar
Linus Torvalds committed
2599 2600 2601 2602

	if (!page)
		return -ENOMEM;

2603
	get_fs_root_and_pwd(current->fs, &root, &pwd);
Linus Torvalds's avatar
Linus Torvalds committed
2604

2605 2606
	error = -ENOENT;
	spin_lock(&dcache_lock);
2607
	if (!d_unlinked(pwd.dentry)) {
2608
		unsigned long len;
2609
		struct path tmp = root;
2610 2611
		char *cwd = page + PAGE_SIZE;
		int buflen = PAGE_SIZE;
Linus Torvalds's avatar
Linus Torvalds committed
2612

2613 2614
		prepend(&cwd, &buflen, "\0", 1);
		error = prepend_path(&pwd, &tmp, &cwd, &buflen);
2615 2616
		spin_unlock(&dcache_lock);

2617
		if (error)
2618 2619
			goto out;

2620 2621 2622 2623 2624 2625 2626
		/* Unreachable from current root */
		if (!path_equal(&tmp, &root)) {
			error = prepend_unreachable(&cwd, &buflen);
			if (error)
				goto out;
		}

2627 2628 2629 2630 2631 2632 2633 2634 2635
		error = -ERANGE;
		len = PAGE_SIZE + page - cwd;
		if (len <= size) {
			error = len;
			if (copy_to_user(buf, cwd, len))
				error = -EFAULT;
		}
	} else
		spin_unlock(&dcache_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2636 2637

out:
Jan Blunck's avatar
Jan Blunck committed
2638 2639
	path_put(&pwd);
	path_put(&root);
Linus Torvalds's avatar
Linus Torvalds committed
2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659
	free_page((unsigned long) page);
	return error;
}

/*
 * Test whether new_dentry is a subdirectory of old_dentry.
 *
 * Trivially implemented using the dcache structure
 */

/**
 * is_subdir - is new dentry a subdirectory of old_dentry
 * @new_dentry: new dentry
 * @old_dentry: old dentry
 *
 * Returns 1 if new_dentry is a subdirectory of the parent (at any depth).
 * Returns 0 otherwise.
 * Caller must ensure that "new_dentry" is pinned before calling is_subdir()
 */
  
2660
int is_subdir(struct dentry *new_dentry, struct dentry *old_dentry)
Linus Torvalds's avatar
Linus Torvalds committed
2661 2662 2663 2664
{
	int result;
	unsigned long seq;

2665 2666 2667 2668 2669 2670
	if (new_dentry == old_dentry)
		return 1;

	/*
	 * Need rcu_readlock to protect against the d_parent trashing
	 * due to d_move
Linus Torvalds's avatar
Linus Torvalds committed
2671 2672
	 */
	rcu_read_lock();
2673
	do {
Linus Torvalds's avatar
Linus Torvalds committed
2674 2675
		/* for restarting inner loop in case of seq retry */
		seq = read_seqbegin(&rename_lock);
2676
		if (d_ancestor(old_dentry, new_dentry))
Linus Torvalds's avatar
Linus Torvalds committed
2677
			result = 1;
2678 2679
		else
			result = 0;
Linus Torvalds's avatar
Linus Torvalds committed
2680 2681 2682 2683 2684 2685
	} while (read_seqretry(&rename_lock, seq));
	rcu_read_unlock();

	return result;
}

2686 2687 2688 2689 2690
int path_is_under(struct path *path1, struct path *path2)
{
	struct vfsmount *mnt = path1->mnt;
	struct dentry *dentry = path1->dentry;
	int res;
Nick Piggin's avatar
Nick Piggin committed
2691 2692

	br_read_lock(vfsmount_lock);
2693 2694 2695
	if (mnt != path2->mnt) {
		for (;;) {
			if (mnt->mnt_parent == mnt) {
Nick Piggin's avatar
Nick Piggin committed
2696
				br_read_unlock(vfsmount_lock);
2697 2698 2699 2700 2701 2702 2703 2704 2705
				return 0;
			}
			if (mnt->mnt_parent == path2->mnt)
				break;
			mnt = mnt->mnt_parent;
		}
		dentry = mnt->mnt_mountpoint;
	}
	res = is_subdir(dentry, path2->dentry);
Nick Piggin's avatar
Nick Piggin committed
2706
	br_read_unlock(vfsmount_lock);
2707 2708 2709 2710
	return res;
}
EXPORT_SYMBOL(path_is_under);

Linus Torvalds's avatar
Linus Torvalds committed
2711 2712 2713 2714 2715 2716
void d_genocide(struct dentry *root)
{
	struct dentry *this_parent = root;
	struct list_head *next;

	spin_lock(&dcache_lock);
Nick Piggin's avatar
Nick Piggin committed
2717
	spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2718 2719 2720 2721 2722
repeat:
	next = this_parent->d_subdirs.next;
resume:
	while (next != &this_parent->d_subdirs) {
		struct list_head *tmp = next;
Eric Dumazet's avatar
Eric Dumazet committed
2723
		struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child);
Linus Torvalds's avatar
Linus Torvalds committed
2724
		next = tmp->next;
Nick Piggin's avatar
Nick Piggin committed
2725 2726 2727
		spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
		if (d_unhashed(dentry) || !dentry->d_inode) {
			spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2728
			continue;
Nick Piggin's avatar
Nick Piggin committed
2729
		}
Linus Torvalds's avatar
Linus Torvalds committed
2730
		if (!list_empty(&dentry->d_subdirs)) {
Nick Piggin's avatar
Nick Piggin committed
2731 2732
			spin_unlock(&this_parent->d_lock);
			spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
2733
			this_parent = dentry;
Nick Piggin's avatar
Nick Piggin committed
2734
			spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_);
Linus Torvalds's avatar
Linus Torvalds committed
2735 2736
			goto repeat;
		}
2737 2738
		dentry->d_count--;
		spin_unlock(&dentry->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2739 2740
	}
	if (this_parent != root) {
Eric Dumazet's avatar
Eric Dumazet committed
2741
		next = this_parent->d_u.d_child.next;
2742 2743
		this_parent->d_count--;
		spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2744
		this_parent = this_parent->d_parent;
Nick Piggin's avatar
Nick Piggin committed
2745
		spin_lock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2746 2747
		goto resume;
	}
Nick Piggin's avatar
Nick Piggin committed
2748
	spin_unlock(&this_parent->d_lock);
Linus Torvalds's avatar
Linus Torvalds committed
2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770
	spin_unlock(&dcache_lock);
}

/**
 * find_inode_number - check for dentry with name
 * @dir: directory to check
 * @name: Name to find.
 *
 * Check whether a dentry already exists for the given name,
 * and return the inode number if it has an inode. Otherwise
 * 0 is returned.
 *
 * This routine is used to post-process directory listings for
 * filesystems using synthetic inode numbers, and is necessary
 * to keep getcwd() working.
 */
 
ino_t find_inode_number(struct dentry *dir, struct qstr *name)
{
	struct dentry * dentry;
	ino_t ino = 0;

2771 2772
	dentry = d_hash_and_lookup(dir, name);
	if (dentry) {
Linus Torvalds's avatar
Linus Torvalds committed
2773 2774 2775 2776 2777 2778
		if (dentry->d_inode)
			ino = dentry->d_inode->i_ino;
		dput(dentry);
	}
	return ino;
}
2779
EXPORT_SYMBOL(find_inode_number);
Linus Torvalds's avatar
Linus Torvalds committed
2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814

static __initdata unsigned long dhash_entries;
static int __init set_dhash_entries(char *str)
{
	if (!str)
		return 0;
	dhash_entries = simple_strtoul(str, &str, 0);
	return 1;
}
__setup("dhash_entries=", set_dhash_entries);

static void __init dcache_init_early(void)
{
	int loop;

	/* If hashes are distributed across NUMA nodes, defer
	 * hash allocation until vmalloc space is available.
	 */
	if (hashdist)
		return;

	dentry_hashtable =
		alloc_large_system_hash("Dentry cache",
					sizeof(struct hlist_head),
					dhash_entries,
					13,
					HASH_EARLY,
					&d_hash_shift,
					&d_hash_mask,
					0);

	for (loop = 0; loop < (1 << d_hash_shift); loop++)
		INIT_HLIST_HEAD(&dentry_hashtable[loop]);
}

2815
static void __init dcache_init(void)
Linus Torvalds's avatar
Linus Torvalds committed
2816 2817 2818 2819 2820 2821 2822 2823
{
	int loop;

	/* 
	 * A constructor could be added for stable state like the lists,
	 * but it is probably not worth it because of the cache nature
	 * of the dcache. 
	 */
2824 2825
	dentry_cache = KMEM_CACHE(dentry,
		SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD);
Linus Torvalds's avatar
Linus Torvalds committed
2826
	
2827
	register_shrinker(&dcache_shrinker);
Linus Torvalds's avatar
Linus Torvalds committed
2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847

	/* Hash may have been set up in dcache_init_early */
	if (!hashdist)
		return;

	dentry_hashtable =
		alloc_large_system_hash("Dentry cache",
					sizeof(struct hlist_head),
					dhash_entries,
					13,
					0,
					&d_hash_shift,
					&d_hash_mask,
					0);

	for (loop = 0; loop < (1 << d_hash_shift); loop++)
		INIT_HLIST_HEAD(&dentry_hashtable[loop]);
}

/* SLAB cache for __getname() consumers */
2848
struct kmem_cache *names_cachep __read_mostly;
2849
EXPORT_SYMBOL(names_cachep);
Linus Torvalds's avatar
Linus Torvalds committed
2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869

EXPORT_SYMBOL(d_genocide);

void __init vfs_caches_init_early(void)
{
	dcache_init_early();
	inode_init_early();
}

void __init vfs_caches_init(unsigned long mempages)
{
	unsigned long reserve;

	/* Base hash sizes on available memory, with a reserve equal to
           150% of current kernel size */

	reserve = min((mempages - nr_free_pages()) * 3/2, mempages - 1);
	mempages -= reserve;

	names_cachep = kmem_cache_create("names_cache", PATH_MAX, 0,
2870
			SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
Linus Torvalds's avatar
Linus Torvalds committed
2871

2872 2873
	dcache_init();
	inode_init();
Linus Torvalds's avatar
Linus Torvalds committed
2874
	files_init(mempages);
2875
	mnt_init();
Linus Torvalds's avatar
Linus Torvalds committed
2876 2877 2878
	bdev_cache_init();
	chrdev_init();
}