inode.c 44.9 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
/*
 * linux/fs/inode.c
 *
 * (C) 1997 Linus Torvalds
 */

#include <linux/fs.h>
#include <linux/mm.h>
#include <linux/dcache.h>
#include <linux/init.h>
#include <linux/slab.h>
#include <linux/writeback.h>
#include <linux/module.h>
#include <linux/backing-dev.h>
#include <linux/wait.h>
Nick Piggin's avatar
Nick Piggin committed
16
#include <linux/rwsem.h>
Linus Torvalds's avatar
Linus Torvalds committed
17 18 19 20 21 22
#include <linux/hash.h>
#include <linux/swap.h>
#include <linux/security.h>
#include <linux/pagemap.h>
#include <linux/cdev.h>
#include <linux/bootmem.h>
23
#include <linux/fsnotify.h>
24
#include <linux/mount.h>
25
#include <linux/async.h>
Al Viro's avatar
Al Viro committed
26
#include <linux/posix_acl.h>
27
#include <linux/ima.h>
28
#include <linux/cred.h>
Linus Torvalds's avatar
Linus Torvalds committed
29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60

/*
 * This is needed for the following functions:
 *  - inode_has_buffers
 *  - invalidate_bdev
 *
 * FIXME: remove all knowledge of the buffer layer from this file
 */
#include <linux/buffer_head.h>

/*
 * New inode.c implementation.
 *
 * This implementation has the basic premise of trying
 * to be extremely low-overhead and SMP-safe, yet be
 * simple enough to be "obviously correct".
 *
 * Famous last words.
 */

/* inode dynamic allocation 1999, Andrea Arcangeli <andrea@suse.de> */

/* #define INODE_PARANOIA 1 */
/* #define INODE_DEBUG 1 */

/*
 * Inode lookup is no longer as critical as it used to be:
 * most of the lookups are going to be through the dcache.
 */
#define I_HASHBITS	i_hash_shift
#define I_HASHMASK	i_hash_mask

61 62
static unsigned int i_hash_mask __read_mostly;
static unsigned int i_hash_shift __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
63 64 65 66 67 68 69 70 71 72 73 74 75

/*
 * Each inode can be on two separate lists. One is
 * the hash list of the inode, used for lookups. The
 * other linked list is the "type" list:
 *  "in_use" - valid inode, i_count > 0, i_nlink > 0
 *  "dirty"  - as "in_use" but also dirty
 *  "unused" - valid inode, i_count = 0
 *
 * A "dirty" list is maintained for each super block,
 * allowing for low-overhead inode sync() operations.
 */

Nick Piggin's avatar
Nick Piggin committed
76
static LIST_HEAD(inode_lru);
77
static struct hlist_head *inode_hashtable __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
78 79 80 81 82 83 84 85 86 87

/*
 * A simple spinlock to protect the list manipulations.
 *
 * NOTE! You also have to own the lock if you change
 * the i_state of an inode while it is in use..
 */
DEFINE_SPINLOCK(inode_lock);

/*
Christoph Hellwig's avatar
Christoph Hellwig committed
88 89
 * iprune_sem provides exclusion between the icache shrinking and the
 * umount path.
Nick Piggin's avatar
Nick Piggin committed
90
 *
Christoph Hellwig's avatar
Christoph Hellwig committed
91 92 93 94
 * We don't actually need it to protect anything in the umount path,
 * but only need to cycle through it to make sure any inode that
 * prune_icache took off the LRU list has been fully torn down by the
 * time we are past evict_inodes.
Linus Torvalds's avatar
Linus Torvalds committed
95
 */
Nick Piggin's avatar
Nick Piggin committed
96
static DECLARE_RWSEM(iprune_sem);
Linus Torvalds's avatar
Linus Torvalds committed
97 98 99 100 101 102

/*
 * Statistics gathering..
 */
struct inodes_stat_t inodes_stat;

103
static DEFINE_PER_CPU(unsigned int, nr_inodes);
104

105
static struct kmem_cache *inode_cachep __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
106

107
static int get_nr_inodes(void)
108
{
109 110 111 112 113
	int i;
	int sum = 0;
	for_each_possible_cpu(i)
		sum += per_cpu(nr_inodes, i);
	return sum < 0 ? 0 : sum;
114 115 116 117
}

static inline int get_nr_inodes_unused(void)
{
118
	return inodes_stat.nr_unused;
119 120 121 122
}

int get_nr_dirty_inodes(void)
{
123
	/* not actually dirty inodes, but a wild approximation */
124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
	int nr_dirty = get_nr_inodes() - get_nr_inodes_unused();
	return nr_dirty > 0 ? nr_dirty : 0;
}

/*
 * Handle nr_inode sysctl
 */
#ifdef CONFIG_SYSCTL
int proc_nr_inodes(ctl_table *table, int write,
		   void __user *buffer, size_t *lenp, loff_t *ppos)
{
	inodes_stat.nr_inodes = get_nr_inodes();
	return proc_dointvec(table, write, buffer, lenp, ppos);
}
#endif

Joern Engel's avatar
Joern Engel committed
140 141 142 143 144 145
static void wake_up_inode(struct inode *inode)
{
	/*
	 * Prevent speculative execution through spin_unlock(&inode_lock);
	 */
	smp_mb();
Christoph Hellwig's avatar
Christoph Hellwig committed
146
	wake_up_bit(&inode->i_state, __I_NEW);
Joern Engel's avatar
Joern Engel committed
147 148
}

149 150
/**
 * inode_init_always - perform inode structure intialisation
151 152
 * @sb: superblock inode belongs to
 * @inode: inode to initialise
153 154 155 156
 *
 * These are initializations that need to be done on every inode
 * allocation as the fields are not initialised by slab allocation.
 */
157
int inode_init_always(struct super_block *sb, struct inode *inode)
Linus Torvalds's avatar
Linus Torvalds committed
158
{
159
	static const struct address_space_operations empty_aops;
160
	static const struct inode_operations empty_iops;
161
	static const struct file_operations empty_fops;
162
	struct address_space *const mapping = &inode->i_data;
163 164 165 166 167 168 169 170

	inode->i_sb = sb;
	inode->i_blkbits = sb->s_blocksize_bits;
	inode->i_flags = 0;
	atomic_set(&inode->i_count, 1);
	inode->i_op = &empty_iops;
	inode->i_fop = &empty_fops;
	inode->i_nlink = 1;
Al Viro's avatar
Al Viro committed
171 172
	inode->i_uid = 0;
	inode->i_gid = 0;
173 174 175 176 177
	atomic_set(&inode->i_writecount, 0);
	inode->i_size = 0;
	inode->i_blocks = 0;
	inode->i_bytes = 0;
	inode->i_generation = 0;
Linus Torvalds's avatar
Linus Torvalds committed
178
#ifdef CONFIG_QUOTA
179
	memset(&inode->i_dquot, 0, sizeof(inode->i_dquot));
Linus Torvalds's avatar
Linus Torvalds committed
180
#endif
181 182 183 184 185
	inode->i_pipe = NULL;
	inode->i_bdev = NULL;
	inode->i_cdev = NULL;
	inode->i_rdev = 0;
	inode->dirtied_when = 0;
Mimi Zohar's avatar
Mimi Zohar committed
186 187

	if (security_inode_alloc(inode))
188
		goto out;
189 190 191 192 193 194 195 196 197 198 199 200
	spin_lock_init(&inode->i_lock);
	lockdep_set_class(&inode->i_lock, &sb->s_type->i_lock_key);

	mutex_init(&inode->i_mutex);
	lockdep_set_class(&inode->i_mutex, &sb->s_type->i_mutex_key);

	init_rwsem(&inode->i_alloc_sem);
	lockdep_set_class(&inode->i_alloc_sem, &sb->s_type->i_alloc_sem_key);

	mapping->a_ops = &empty_aops;
	mapping->host = inode;
	mapping->flags = 0;
201
	mapping_set_gfp_mask(mapping, GFP_HIGHUSER_MOVABLE);
202 203 204 205 206 207 208 209 210 211 212 213
	mapping->assoc_mapping = NULL;
	mapping->backing_dev_info = &default_backing_dev_info;
	mapping->writeback_index = 0;

	/*
	 * If the block_device provides a backing_dev_info for client
	 * inodes then use that.  Otherwise the inode share the bdev's
	 * backing_dev_info.
	 */
	if (sb->s_bdev) {
		struct backing_dev_info *bdi;

214
		bdi = sb->s_bdev->bd_inode->i_mapping->backing_dev_info;
215 216 217 218
		mapping->backing_dev_info = bdi;
	}
	inode->i_private = NULL;
	inode->i_mapping = mapping;
Al Viro's avatar
Al Viro committed
219 220 221
#ifdef CONFIG_FS_POSIX_ACL
	inode->i_acl = inode->i_default_acl = ACL_NOT_CACHED;
#endif
222

223 224 225 226
#ifdef CONFIG_FSNOTIFY
	inode->i_fsnotify_mask = 0;
#endif

227
	this_cpu_inc(nr_inodes);
228

229 230 231
	return 0;
out:
	return -ENOMEM;
Linus Torvalds's avatar
Linus Torvalds committed
232
}
233 234 235 236 237 238 239 240 241 242 243
EXPORT_SYMBOL(inode_init_always);

static struct inode *alloc_inode(struct super_block *sb)
{
	struct inode *inode;

	if (sb->s_op->alloc_inode)
		inode = sb->s_op->alloc_inode(sb);
	else
		inode = kmem_cache_alloc(inode_cachep, GFP_KERNEL);

244 245 246 247 248 249 250 251 252 253 254 255
	if (!inode)
		return NULL;

	if (unlikely(inode_init_always(sb, inode))) {
		if (inode->i_sb->s_op->destroy_inode)
			inode->i_sb->s_op->destroy_inode(inode);
		else
			kmem_cache_free(inode_cachep, inode);
		return NULL;
	}

	return inode;
256
}
Linus Torvalds's avatar
Linus Torvalds committed
257

258 259 260 261 262 263
void free_inode_nonrcu(struct inode *inode)
{
	kmem_cache_free(inode_cachep, inode);
}
EXPORT_SYMBOL(free_inode_nonrcu);

Christoph Hellwig's avatar
Christoph Hellwig committed
264
void __destroy_inode(struct inode *inode)
Linus Torvalds's avatar
Linus Torvalds committed
265
{
266
	BUG_ON(inode_has_buffers(inode));
Linus Torvalds's avatar
Linus Torvalds committed
267
	security_inode_free(inode);
268
	fsnotify_inode_delete(inode);
Al Viro's avatar
Al Viro committed
269 270 271 272 273 274
#ifdef CONFIG_FS_POSIX_ACL
	if (inode->i_acl && inode->i_acl != ACL_NOT_CACHED)
		posix_acl_release(inode->i_acl);
	if (inode->i_default_acl && inode->i_default_acl != ACL_NOT_CACHED)
		posix_acl_release(inode->i_default_acl);
#endif
275
	this_cpu_dec(nr_inodes);
Christoph Hellwig's avatar
Christoph Hellwig committed
276 277 278
}
EXPORT_SYMBOL(__destroy_inode);

Nick Piggin's avatar
Nick Piggin committed
279 280 281 282 283 284 285
static void i_callback(struct rcu_head *head)
{
	struct inode *inode = container_of(head, struct inode, i_rcu);
	INIT_LIST_HEAD(&inode->i_dentry);
	kmem_cache_free(inode_cachep, inode);
}

286
static void destroy_inode(struct inode *inode)
Christoph Hellwig's avatar
Christoph Hellwig committed
287
{
Nick Piggin's avatar
Nick Piggin committed
288
	BUG_ON(!list_empty(&inode->i_lru));
Christoph Hellwig's avatar
Christoph Hellwig committed
289
	__destroy_inode(inode);
Linus Torvalds's avatar
Linus Torvalds committed
290 291 292
	if (inode->i_sb->s_op->destroy_inode)
		inode->i_sb->s_op->destroy_inode(inode);
	else
Nick Piggin's avatar
Nick Piggin committed
293
		call_rcu(&inode->i_rcu, i_callback);
Linus Torvalds's avatar
Linus Torvalds committed
294 295
}

296 297 298 299 300 301 302 303 304 305 306 307 308 309
void address_space_init_once(struct address_space *mapping)
{
	memset(mapping, 0, sizeof(*mapping));
	INIT_RADIX_TREE(&mapping->page_tree, GFP_ATOMIC);
	spin_lock_init(&mapping->tree_lock);
	spin_lock_init(&mapping->i_mmap_lock);
	INIT_LIST_HEAD(&mapping->private_list);
	spin_lock_init(&mapping->private_lock);
	INIT_RAW_PRIO_TREE_ROOT(&mapping->i_mmap);
	INIT_LIST_HEAD(&mapping->i_mmap_nonlinear);
	mutex_init(&mapping->unmap_mutex);
}
EXPORT_SYMBOL(address_space_init_once);

Linus Torvalds's avatar
Linus Torvalds committed
310 311 312 313 314 315 316 317 318 319 320
/*
 * These are initializations that only need to be done
 * once, because the fields are idempotent across use
 * of the inode, so let the slab aware of that.
 */
void inode_init_once(struct inode *inode)
{
	memset(inode, 0, sizeof(*inode));
	INIT_HLIST_NODE(&inode->i_hash);
	INIT_LIST_HEAD(&inode->i_dentry);
	INIT_LIST_HEAD(&inode->i_devices);
Nick Piggin's avatar
Nick Piggin committed
321 322
	INIT_LIST_HEAD(&inode->i_wb_list);
	INIT_LIST_HEAD(&inode->i_lru);
323
	address_space_init_once(&inode->i_data);
Linus Torvalds's avatar
Linus Torvalds committed
324
	i_size_ordered_init(inode);
325
#ifdef CONFIG_FSNOTIFY
326
	INIT_HLIST_HEAD(&inode->i_fsnotify_marks);
327
#endif
Linus Torvalds's avatar
Linus Torvalds committed
328 329 330
}
EXPORT_SYMBOL(inode_init_once);

331
static void init_once(void *foo)
Linus Torvalds's avatar
Linus Torvalds committed
332
{
333
	struct inode *inode = (struct inode *) foo;
Linus Torvalds's avatar
Linus Torvalds committed
334

335
	inode_init_once(inode);
Linus Torvalds's avatar
Linus Torvalds committed
336 337 338 339 340
}

/*
 * inode_lock must be held
 */
341
void __iget(struct inode *inode)
Linus Torvalds's avatar
Linus Torvalds committed
342
{
343 344
	atomic_inc(&inode->i_count);
}
345

Al Viro's avatar
Al Viro committed
346 347 348 349 350 351 352 353 354
/*
 * get additional reference to inode; caller must already hold one.
 */
void ihold(struct inode *inode)
{
	WARN_ON(atomic_inc_return(&inode->i_count) < 2);
}
EXPORT_SYMBOL(ihold);

355 356
static void inode_lru_list_add(struct inode *inode)
{
Nick Piggin's avatar
Nick Piggin committed
357 358
	if (list_empty(&inode->i_lru)) {
		list_add(&inode->i_lru, &inode_lru);
359
		inodes_stat.nr_unused++;
360 361
	}
}
362

363 364
static void inode_lru_list_del(struct inode *inode)
{
Nick Piggin's avatar
Nick Piggin committed
365 366
	if (!list_empty(&inode->i_lru)) {
		list_del_init(&inode->i_lru);
367
		inodes_stat.nr_unused--;
368
	}
Linus Torvalds's avatar
Linus Torvalds committed
369 370
}

371 372 373
static inline void __inode_sb_list_add(struct inode *inode)
{
	list_add(&inode->i_sb_list, &inode->i_sb->s_inodes);
Linus Torvalds's avatar
Linus Torvalds committed
374 375
}

376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392
/**
 * inode_sb_list_add - add inode to the superblock list of inodes
 * @inode: inode to add
 */
void inode_sb_list_add(struct inode *inode)
{
	spin_lock(&inode_lock);
	__inode_sb_list_add(inode);
	spin_unlock(&inode_lock);
}
EXPORT_SYMBOL_GPL(inode_sb_list_add);

static inline void __inode_sb_list_del(struct inode *inode)
{
	list_del_init(&inode->i_sb_list);
}

393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
static unsigned long hash(struct super_block *sb, unsigned long hashval)
{
	unsigned long tmp;

	tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) /
			L1_CACHE_BYTES;
	tmp = tmp ^ ((tmp ^ GOLDEN_RATIO_PRIME) >> I_HASHBITS);
	return tmp & I_HASHMASK;
}

/**
 *	__insert_inode_hash - hash an inode
 *	@inode: unhashed inode
 *	@hashval: unsigned long value used to locate this object in the
 *		inode_hashtable.
 *
 *	Add an inode to the inode hash for this superblock.
 */
void __insert_inode_hash(struct inode *inode, unsigned long hashval)
{
413 414
	struct hlist_head *b = inode_hashtable + hash(inode->i_sb, hashval);

415
	spin_lock(&inode_lock);
416
	hlist_add_head(&inode->i_hash, b);
417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
	spin_unlock(&inode_lock);
}
EXPORT_SYMBOL(__insert_inode_hash);

/**
 *	__remove_inode_hash - remove an inode from the hash
 *	@inode: inode to unhash
 *
 *	Remove an inode from the superblock.
 */
static void __remove_inode_hash(struct inode *inode)
{
	hlist_del_init(&inode->i_hash);
}

/**
 *	remove_inode_hash - remove an inode from the hash
 *	@inode: inode to unhash
 *
 *	Remove an inode from the superblock.
 */
void remove_inode_hash(struct inode *inode)
{
	spin_lock(&inode_lock);
	hlist_del_init(&inode->i_hash);
	spin_unlock(&inode_lock);
}
EXPORT_SYMBOL(remove_inode_hash);

Al Viro's avatar
Al Viro committed
446 447 448 449 450 451 452 453
void end_writeback(struct inode *inode)
{
	might_sleep();
	BUG_ON(inode->i_data.nrpages);
	BUG_ON(!list_empty(&inode->i_data.private_list));
	BUG_ON(!(inode->i_state & I_FREEING));
	BUG_ON(inode->i_state & I_CLEAR);
	inode_sync_wait(inode);
Nick Piggin's avatar
Nick Piggin committed
454
	/* don't need i_lock here, no concurrent mods to i_state */
Al Viro's avatar
Al Viro committed
455 456 457 458
	inode->i_state = I_FREEING | I_CLEAR;
}
EXPORT_SYMBOL(end_writeback);

459
static void evict(struct inode *inode)
460 461 462
{
	const struct super_operations *op = inode->i_sb->s_op;

Al Viro's avatar
Al Viro committed
463 464
	if (op->evict_inode) {
		op->evict_inode(inode);
465 466 467
	} else {
		if (inode->i_data.nrpages)
			truncate_inode_pages(&inode->i_data, 0);
Al Viro's avatar
Al Viro committed
468
		end_writeback(inode);
469
	}
470 471 472 473
	if (S_ISBLK(inode->i_mode) && inode->i_bdev)
		bd_forget(inode);
	if (S_ISCHR(inode->i_mode) && inode->i_cdev)
		cd_forget(inode);
474 475
}

Linus Torvalds's avatar
Linus Torvalds committed
476 477 478 479 480 481 482 483 484 485 486 487
/*
 * dispose_list - dispose of the contents of a local list
 * @head: the head of the list to free
 *
 * Dispose-list gets a local list with local inodes in it, so it doesn't
 * need to worry about list corruption and SMP locks.
 */
static void dispose_list(struct list_head *head)
{
	while (!list_empty(head)) {
		struct inode *inode;

Nick Piggin's avatar
Nick Piggin committed
488 489
		inode = list_first_entry(head, struct inode, i_lru);
		list_del_init(&inode->i_lru);
Linus Torvalds's avatar
Linus Torvalds committed
490

491
		evict(inode);
492 493

		spin_lock(&inode_lock);
494
		__remove_inode_hash(inode);
495
		__inode_sb_list_del(inode);
496 497 498
		spin_unlock(&inode_lock);

		wake_up_inode(inode);
Linus Torvalds's avatar
Linus Torvalds committed
499 500 501 502
		destroy_inode(inode);
	}
}

Al Viro's avatar
Al Viro committed
503 504 505 506 507 508 509 510
/**
 * evict_inodes	- evict all evictable inodes for a superblock
 * @sb:		superblock to operate on
 *
 * Make sure that no inodes with zero refcount are retained.  This is
 * called by superblock shutdown after having MS_ACTIVE flag removed,
 * so any inode reaching zero refcount during or after that call will
 * be immediately evicted.
Linus Torvalds's avatar
Linus Torvalds committed
511
 */
Al Viro's avatar
Al Viro committed
512
void evict_inodes(struct super_block *sb)
Linus Torvalds's avatar
Linus Torvalds committed
513
{
Al Viro's avatar
Al Viro committed
514 515
	struct inode *inode, *next;
	LIST_HEAD(dispose);
Linus Torvalds's avatar
Linus Torvalds committed
516

Al Viro's avatar
Al Viro committed
517 518 519
	spin_lock(&inode_lock);
	list_for_each_entry_safe(inode, next, &sb->s_inodes, i_sb_list) {
		if (atomic_read(&inode->i_count))
Nick Piggin's avatar
Nick Piggin committed
520
			continue;
Christoph Hellwig's avatar
Christoph Hellwig committed
521
		if (inode->i_state & (I_NEW | I_FREEING | I_WILL_FREE))
Linus Torvalds's avatar
Linus Torvalds committed
522
			continue;
Al Viro's avatar
Al Viro committed
523 524 525 526 527 528 529 530 531 532

		inode->i_state |= I_FREEING;

		/*
		 * Move the inode off the IO lists and LRU once I_FREEING is
		 * set so that it won't get moved back on there if it is dirty.
		 */
		list_move(&inode->i_lru, &dispose);
		list_del_init(&inode->i_wb_list);
		if (!(inode->i_state & (I_DIRTY | I_SYNC)))
533
			inodes_stat.nr_unused--;
Linus Torvalds's avatar
Linus Torvalds committed
534
	}
Al Viro's avatar
Al Viro committed
535 536 537
	spin_unlock(&inode_lock);

	dispose_list(&dispose);
Christoph Hellwig's avatar
Christoph Hellwig committed
538 539 540 541 542 543 544

	/*
	 * Cycle through iprune_sem to make sure any inode that prune_icache
	 * moved off the list before we took the lock has been fully torn
	 * down.
	 */
	down_write(&iprune_sem);
Al Viro's avatar
Al Viro committed
545
	up_write(&iprune_sem);
Linus Torvalds's avatar
Linus Torvalds committed
546 547 548
}

/**
549 550
 * invalidate_inodes	- attempt to free all inodes on a superblock
 * @sb:		superblock to operate on
551
 * @kill_dirty: flag to guide handling of dirty inodes
Linus Torvalds's avatar
Linus Torvalds committed
552
 *
553 554
 * Attempts to free all inodes for a given superblock.  If there were any
 * busy inodes return a non-zero value, else zero.
555 556
 * If @kill_dirty is set, discard dirty inodes too, otherwise treat
 * them as busy.
Linus Torvalds's avatar
Linus Torvalds committed
557
 */
558
int invalidate_inodes(struct super_block *sb, bool kill_dirty)
Linus Torvalds's avatar
Linus Torvalds committed
559
{
560
	int busy = 0;
561 562
	struct inode *inode, *next;
	LIST_HEAD(dispose);
Linus Torvalds's avatar
Linus Torvalds committed
563 564

	spin_lock(&inode_lock);
565
	list_for_each_entry_safe(inode, next, &sb->s_inodes, i_sb_list) {
Al Viro's avatar
Al Viro committed
566
		if (inode->i_state & (I_NEW | I_FREEING | I_WILL_FREE))
Nick Piggin's avatar
Nick Piggin committed
567
			continue;
568 569 570 571
		if (inode->i_state & I_DIRTY && !kill_dirty) {
			busy = 1;
			continue;
		}
572 573
		if (atomic_read(&inode->i_count)) {
			busy = 1;
Linus Torvalds's avatar
Linus Torvalds committed
574 575
			continue;
		}
576 577

		inode->i_state |= I_FREEING;
Nick Piggin's avatar
Nick Piggin committed
578 579 580 581 582

		/*
		 * Move the inode off the IO lists and LRU once I_FREEING is
		 * set so that it won't get moved back on there if it is dirty.
		 */
583
		list_move(&inode->i_lru, &dispose);
Nick Piggin's avatar
Nick Piggin committed
584
		list_del_init(&inode->i_wb_list);
585
		if (!(inode->i_state & (I_DIRTY | I_SYNC)))
586
			inodes_stat.nr_unused--;
Linus Torvalds's avatar
Linus Torvalds committed
587 588 589
	}
	spin_unlock(&inode_lock);

590
	dispose_list(&dispose);
Linus Torvalds's avatar
Linus Torvalds committed
591 592 593 594 595 596

	return busy;
}

static int can_unuse(struct inode *inode)
{
597
	if (inode->i_state & ~I_REFERENCED)
Linus Torvalds's avatar
Linus Torvalds committed
598 599 600 601 602 603 604 605 606 607 608
		return 0;
	if (inode_has_buffers(inode))
		return 0;
	if (atomic_read(&inode->i_count))
		return 0;
	if (inode->i_data.nrpages)
		return 0;
	return 1;
}

/*
609 610
 * Scan `goal' inodes on the unused list for freeable ones. They are moved to a
 * temporary list and then are freed outside inode_lock by dispose_list().
Linus Torvalds's avatar
Linus Torvalds committed
611 612
 *
 * Any inodes which are pinned purely because of attached pagecache have their
613 614
 * pagecache removed.  If the inode has metadata buffers attached to
 * mapping->private_list then try to remove them.
Linus Torvalds's avatar
Linus Torvalds committed
615
 *
616 617 618 619 620 621 622
 * If the inode has the I_REFERENCED flag set, then it means that it has been
 * used recently - the flag is set in iput_final(). When we encounter such an
 * inode, clear the flag and move it to the back of the LRU so it gets another
 * pass through the LRU before it gets reclaimed. This is necessary because of
 * the fact we are doing lazy LRU updates to minimise lock contention so the
 * LRU does not have strict ordering. Hence we don't want to reclaim inodes
 * with this flag set because they are the inodes that are out of order.
Linus Torvalds's avatar
Linus Torvalds committed
623 624 625 626 627 628 629
 */
static void prune_icache(int nr_to_scan)
{
	LIST_HEAD(freeable);
	int nr_scanned;
	unsigned long reap = 0;

Nick Piggin's avatar
Nick Piggin committed
630
	down_read(&iprune_sem);
Linus Torvalds's avatar
Linus Torvalds committed
631 632 633 634
	spin_lock(&inode_lock);
	for (nr_scanned = 0; nr_scanned < nr_to_scan; nr_scanned++) {
		struct inode *inode;

Nick Piggin's avatar
Nick Piggin committed
635
		if (list_empty(&inode_lru))
Linus Torvalds's avatar
Linus Torvalds committed
636 637
			break;

Nick Piggin's avatar
Nick Piggin committed
638
		inode = list_entry(inode_lru.prev, struct inode, i_lru);
Linus Torvalds's avatar
Linus Torvalds committed
639

640 641 642 643 644 645
		/*
		 * Referenced or dirty inodes are still in use. Give them
		 * another pass through the LRU as we canot reclaim them now.
		 */
		if (atomic_read(&inode->i_count) ||
		    (inode->i_state & ~I_REFERENCED)) {
Nick Piggin's avatar
Nick Piggin committed
646
			list_del_init(&inode->i_lru);
647
			inodes_stat.nr_unused--;
648 649 650 651 652
			continue;
		}

		/* recently referenced inodes get one more pass */
		if (inode->i_state & I_REFERENCED) {
Nick Piggin's avatar
Nick Piggin committed
653
			list_move(&inode->i_lru, &inode_lru);
654
			inode->i_state &= ~I_REFERENCED;
Linus Torvalds's avatar
Linus Torvalds committed
655 656 657 658 659 660
			continue;
		}
		if (inode_has_buffers(inode) || inode->i_data.nrpages) {
			__iget(inode);
			spin_unlock(&inode_lock);
			if (remove_inode_buffers(inode))
661 662
				reap += invalidate_mapping_pages(&inode->i_data,
								0, -1);
Linus Torvalds's avatar
Linus Torvalds committed
663 664 665
			iput(inode);
			spin_lock(&inode_lock);

Nick Piggin's avatar
Nick Piggin committed
666 667
			if (inode != list_entry(inode_lru.next,
						struct inode, i_lru))
Linus Torvalds's avatar
Linus Torvalds committed
668 669 670 671
				continue;	/* wrong inode or list_empty */
			if (!can_unuse(inode))
				continue;
		}
672
		WARN_ON(inode->i_state & I_NEW);
Linus Torvalds's avatar
Linus Torvalds committed
673
		inode->i_state |= I_FREEING;
Nick Piggin's avatar
Nick Piggin committed
674 675 676 677 678 679 680

		/*
		 * Move the inode off the IO lists and LRU once I_FREEING is
		 * set so that it won't get moved back on there if it is dirty.
		 */
		list_move(&inode->i_lru, &freeable);
		list_del_init(&inode->i_wb_list);
681
		inodes_stat.nr_unused--;
Linus Torvalds's avatar
Linus Torvalds committed
682
	}
683 684 685 686
	if (current_is_kswapd())
		__count_vm_events(KSWAPD_INODESTEAL, reap);
	else
		__count_vm_events(PGINODESTEAL, reap);
Linus Torvalds's avatar
Linus Torvalds committed
687 688 689
	spin_unlock(&inode_lock);

	dispose_list(&freeable);
Nick Piggin's avatar
Nick Piggin committed
690
	up_read(&iprune_sem);
Linus Torvalds's avatar
Linus Torvalds committed
691 692 693 694 695 696 697 698 699 700 701
}

/*
 * shrink_icache_memory() will attempt to reclaim some unused inodes.  Here,
 * "unused" means that no dentries are referring to the inodes: the files are
 * not open and the dcache references to those inodes have already been
 * reclaimed.
 *
 * This function is passed the number of inodes to scan, and it returns the
 * total number of remaining possibly-reclaimable inodes.
 */
702
static int shrink_icache_memory(struct shrinker *shrink, int nr, gfp_t gfp_mask)
Linus Torvalds's avatar
Linus Torvalds committed
703 704 705 706 707 708
{
	if (nr) {
		/*
		 * Nasty deadlock avoidance.  We may hold various FS locks,
		 * and we don't want to recurse into the FS that called us
		 * in clear_inode() and friends..
709
		 */
Linus Torvalds's avatar
Linus Torvalds committed
710 711 712 713
		if (!(gfp_mask & __GFP_FS))
			return -1;
		prune_icache(nr);
	}
714
	return (get_nr_inodes_unused() / 100) * sysctl_vfs_cache_pressure;
Linus Torvalds's avatar
Linus Torvalds committed
715 716
}

717 718 719 720 721
static struct shrinker icache_shrinker = {
	.shrink = shrink_icache_memory,
	.seeks = DEFAULT_SEEKS,
};

Linus Torvalds's avatar
Linus Torvalds committed
722 723 724 725
static void __wait_on_freeing_inode(struct inode *inode);
/*
 * Called with the inode lock held.
 */
726 727 728 729
static struct inode *find_inode(struct super_block *sb,
				struct hlist_head *head,
				int (*test)(struct inode *, void *),
				void *data)
Linus Torvalds's avatar
Linus Torvalds committed
730 731
{
	struct hlist_node *node;
732
	struct inode *inode = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
733 734

repeat:
735
	hlist_for_each_entry(inode, node, head, i_hash) {
Linus Torvalds's avatar
Linus Torvalds committed
736 737 738 739
		if (inode->i_sb != sb)
			continue;
		if (!test(inode, data))
			continue;
740
		if (inode->i_state & (I_FREEING|I_WILL_FREE)) {
Linus Torvalds's avatar
Linus Torvalds committed
741 742 743
			__wait_on_freeing_inode(inode);
			goto repeat;
		}
744 745
		__iget(inode);
		return inode;
Linus Torvalds's avatar
Linus Torvalds committed
746
	}
747
	return NULL;
Linus Torvalds's avatar
Linus Torvalds committed
748 749 750 751 752 753
}

/*
 * find_inode_fast is the fast path version of find_inode, see the comment at
 * iget_locked for details.
 */
754 755
static struct inode *find_inode_fast(struct super_block *sb,
				struct hlist_head *head, unsigned long ino)
Linus Torvalds's avatar
Linus Torvalds committed
756 757
{
	struct hlist_node *node;
758
	struct inode *inode = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
759 760

repeat:
761
	hlist_for_each_entry(inode, node, head, i_hash) {
Linus Torvalds's avatar
Linus Torvalds committed
762 763 764 765
		if (inode->i_ino != ino)
			continue;
		if (inode->i_sb != sb)
			continue;
766
		if (inode->i_state & (I_FREEING|I_WILL_FREE)) {
Linus Torvalds's avatar
Linus Torvalds committed
767 768 769
			__wait_on_freeing_inode(inode);
			goto repeat;
		}
770 771
		__iget(inode);
		return inode;
Linus Torvalds's avatar
Linus Torvalds committed
772
	}
773
	return NULL;
774 775
}

776 777 778 779
/*
 * Each cpu owns a range of LAST_INO_BATCH numbers.
 * 'shared_last_ino' is dirtied only once out of LAST_INO_BATCH allocations,
 * to renew the exhausted range.
780
 *
781 782 783 784 785 786 787 788 789
 * This does not significantly increase overflow rate because every CPU can
 * consume at most LAST_INO_BATCH-1 unused inode numbers. So there is
 * NR_CPUS*(LAST_INO_BATCH-1) wastage. At 4096 and 1024, this is ~0.1% of the
 * 2^32 range, and is a worst-case. Even a 50% wastage would only increase
 * overflow rate by 2x, which does not seem too significant.
 *
 * On a 32bit, non LFS stat() call, glibc will generate an EOVERFLOW
 * error if st_ino won't fit in target struct field. Use 32bit counter
 * here to attempt to avoid that.
790
 */
791 792 793
#define LAST_INO_BATCH 1024
static DEFINE_PER_CPU(unsigned int, last_ino);

794
unsigned int get_next_ino(void)
795
{
796 797
	unsigned int *p = &get_cpu_var(last_ino);
	unsigned int res = *p;
798

799 800 801 802 803 804 805 806 807 808 809 810
#ifdef CONFIG_SMP
	if (unlikely((res & (LAST_INO_BATCH-1)) == 0)) {
		static atomic_t shared_last_ino;
		int next = atomic_add_return(LAST_INO_BATCH, &shared_last_ino);

		res = next - LAST_INO_BATCH;
	}
#endif

	*p = ++res;
	put_cpu_var(last_ino);
	return res;
811
}
812
EXPORT_SYMBOL(get_next_ino);
813

Linus Torvalds's avatar
Linus Torvalds committed
814 815 816 817
/**
 *	new_inode 	- obtain an inode
 *	@sb: superblock
 *
818
 *	Allocates a new inode for given superblock. The default gfp_mask
819
 *	for allocations related to inode->i_mapping is GFP_HIGHUSER_MOVABLE.
820 821 822 823 824
 *	If HIGHMEM pages are unsuitable or it is known that pages allocated
 *	for the page cache are not reclaimable or migratable,
 *	mapping_set_gfp_mask() must be called with suitable flags on the
 *	newly created inode's mapping
 *
Linus Torvalds's avatar
Linus Torvalds committed
825 826 827
 */
struct inode *new_inode(struct super_block *sb)
{
828
	struct inode *inode;
Linus Torvalds's avatar
Linus Torvalds committed
829 830

	spin_lock_prefetch(&inode_lock);
831

Linus Torvalds's avatar
Linus Torvalds committed
832 833 834
	inode = alloc_inode(sb);
	if (inode) {
		spin_lock(&inode_lock);
835
		__inode_sb_list_add(inode);
Linus Torvalds's avatar
Linus Torvalds committed
836 837 838 839 840 841 842 843 844
		inode->i_state = 0;
		spin_unlock(&inode_lock);
	}
	return inode;
}
EXPORT_SYMBOL(new_inode);

void unlock_new_inode(struct inode *inode)
{
845
#ifdef CONFIG_DEBUG_LOCK_ALLOC
846
	if (S_ISDIR(inode->i_mode)) {
847 848
		struct file_system_type *type = inode->i_sb->s_type;

849 850 851 852 853 854 855 856 857 858 859
		/* Set new key only if filesystem hasn't already changed it */
		if (!lockdep_match_class(&inode->i_mutex,
		    &type->i_mutex_key)) {
			/*
			 * ensure nobody is actually holding i_mutex
			 */
			mutex_destroy(&inode->i_mutex);
			mutex_init(&inode->i_mutex);
			lockdep_set_class(&inode->i_mutex,
					  &type->i_mutex_dir_key);
		}
860
	}
861
#endif
Linus Torvalds's avatar
Linus Torvalds committed
862
	/*
Christoph Hellwig's avatar
Christoph Hellwig committed
863
	 * This is special!  We do not need the spinlock when clearing I_NEW,
864 865
	 * because we're guaranteed that nobody else tries to do anything about
	 * the state of the inode when it is locked, as we just created it (so
Christoph Hellwig's avatar
Christoph Hellwig committed
866
	 * there can be no old holders that haven't tested I_NEW).
867
	 * However we must emit the memory barrier so that other CPUs reliably
Christoph Hellwig's avatar
Christoph Hellwig committed
868
	 * see the clearing of I_NEW after the other inode initialisation has
869
	 * completed.
Linus Torvalds's avatar
Linus Torvalds committed
870
	 */
871
	smp_mb();
Christoph Hellwig's avatar
Christoph Hellwig committed
872 873
	WARN_ON(!(inode->i_state & I_NEW));
	inode->i_state &= ~I_NEW;
Linus Torvalds's avatar
Linus Torvalds committed
874 875 876 877 878 879 880 881 882 883
	wake_up_inode(inode);
}
EXPORT_SYMBOL(unlock_new_inode);

/*
 * This is called without the inode lock held.. Be careful.
 *
 * We no longer cache the sb_flags in i_flags - see fs.h
 *	-- rmk@arm.uk.linux.org
 */
884 885 886 887 888
static struct inode *get_new_inode(struct super_block *sb,
				struct hlist_head *head,
				int (*test)(struct inode *, void *),
				int (*set)(struct inode *, void *),
				void *data)
Linus Torvalds's avatar
Linus Torvalds committed
889
{
890
	struct inode *inode;
Linus Torvalds's avatar
Linus Torvalds committed
891 892 893

	inode = alloc_inode(sb);
	if (inode) {
894
		struct inode *old;
Linus Torvalds's avatar
Linus Torvalds committed
895 896 897 898 899 900 901 902

		spin_lock(&inode_lock);
		/* We released the lock, so.. */
		old = find_inode(sb, head, test, data);
		if (!old) {
			if (set(inode, data))
				goto set_failed;

903 904
			hlist_add_head(&inode->i_hash, head);
			__inode_sb_list_add(inode);
Christoph Hellwig's avatar
Christoph Hellwig committed
905
			inode->i_state = I_NEW;
Linus Torvalds's avatar
Linus Torvalds committed
906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935
			spin_unlock(&inode_lock);

			/* Return the locked inode with I_NEW set, the
			 * caller is responsible for filling in the contents
			 */
			return inode;
		}

		/*
		 * Uhhuh, somebody else created the same inode under
		 * us. Use the old inode instead of the one we just
		 * allocated.
		 */
		spin_unlock(&inode_lock);
		destroy_inode(inode);
		inode = old;
		wait_on_inode(inode);
	}
	return inode;

set_failed:
	spin_unlock(&inode_lock);
	destroy_inode(inode);
	return NULL;
}

/*
 * get_new_inode_fast is the fast path version of get_new_inode, see the
 * comment at iget_locked for details.
 */
936 937
static struct inode *get_new_inode_fast(struct super_block *sb,
				struct hlist_head *head, unsigned long ino)
Linus Torvalds's avatar
Linus Torvalds committed
938
{
939
	struct inode *inode;
Linus Torvalds's avatar
Linus Torvalds committed
940 941 942

	inode = alloc_inode(sb);
	if (inode) {
943
		struct inode *old;
Linus Torvalds's avatar
Linus Torvalds committed
944 945 946 947 948 949

		spin_lock(&inode_lock);
		/* We released the lock, so.. */
		old = find_inode_fast(sb, head, ino);
		if (!old) {
			inode->i_ino = ino;
950 951
			hlist_add_head(&inode->i_hash, head);
			__inode_sb_list_add(inode);
Christoph Hellwig's avatar
Christoph Hellwig committed
952
			inode->i_state = I_NEW;
Linus Torvalds's avatar
Linus Torvalds committed
953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973
			spin_unlock(&inode_lock);

			/* Return the locked inode with I_NEW set, the
			 * caller is responsible for filling in the contents
			 */
			return inode;
		}

		/*
		 * Uhhuh, somebody else created the same inode under
		 * us. Use the old inode instead of the one we just
		 * allocated.
		 */
		spin_unlock(&inode_lock);
		destroy_inode(inode);
		inode = old;
		wait_on_inode(inode);
	}
	return inode;
}

974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994
/*
 * search the inode cache for a matching inode number.
 * If we find one, then the inode number we are trying to
 * allocate is not unique and so we should not use it.
 *
 * Returns 1 if the inode number is unique, 0 if it is not.
 */
static int test_inode_iunique(struct super_block *sb, unsigned long ino)
{
	struct hlist_head *b = inode_hashtable + hash(sb, ino);
	struct hlist_node *node;
	struct inode *inode;

	hlist_for_each_entry(inode, node, b, i_hash) {
		if (inode->i_ino == ino && inode->i_sb == sb)
			return 0;
	}

	return 1;
}

Linus Torvalds's avatar
Linus Torvalds committed
995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010
/**
 *	iunique - get a unique inode number
 *	@sb: superblock
 *	@max_reserved: highest reserved inode number
 *
 *	Obtain an inode number that is unique on the system for a given
 *	superblock. This is used by file systems that have no natural
 *	permanent inode numbering system. An inode number is returned that
 *	is higher than the reserved limit but unique.
 *
 *	BUGS:
 *	With a large number of inodes live on the file system this function
 *	currently becomes quite slow.
 */
ino_t iunique(struct super_block *sb, ino_t max_reserved)
{
1011 1012 1013 1014 1015
	/*
	 * On a 32bit, non LFS stat() call, glibc will generate an EOVERFLOW
	 * error if st_ino won't fit in target struct field. Use 32bit counter
	 * here to attempt to avoid that.
	 */
1016
	static DEFINE_SPINLOCK(iunique_lock);
1017
	static unsigned int counter;
Linus Torvalds's avatar
Linus Torvalds committed
1018
	ino_t res;
1019

Linus Torvalds's avatar
Linus Torvalds committed
1020
	spin_lock(&inode_lock);
1021
	spin_lock(&iunique_lock);
1022 1023 1024
	do {
		if (counter <= max_reserved)
			counter = max_reserved + 1;
Linus Torvalds's avatar
Linus Torvalds committed
1025
		res = counter++;
1026 1027
	} while (!test_inode_iunique(sb, res));
	spin_unlock(&iunique_lock);
1028
	spin_unlock(&inode_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1029

1030 1031
	return res;
}
Linus Torvalds's avatar
Linus Torvalds committed
1032 1033 1034 1035 1036
EXPORT_SYMBOL(iunique);

struct inode *igrab(struct inode *inode)
{
	spin_lock(&inode_lock);
1037
	if (!(inode->i_state & (I_FREEING|I_WILL_FREE)))
Linus Torvalds's avatar
Linus Torvalds committed
1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
		__iget(inode);
	else
		/*
		 * Handle the case where s_op->clear_inode is not been
		 * called yet, and somebody is calling igrab
		 * while the inode is getting freed.
		 */
		inode = NULL;
	spin_unlock(&inode_lock);
	return inode;
}
EXPORT_SYMBOL(igrab);

/**
 * ifind - internal function, you want ilookup5() or iget5().
 * @sb:		super block of file system to search
 * @head:       the head of the list to search
 * @test:	callback used for comparisons between inodes
 * @data:	opaque data pointer to pass to @test
1057
 * @wait:	if true wait for the inode to be unlocked, if false do not
Linus Torvalds's avatar
Linus Torvalds committed
1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
 *
 * ifind() searches for the inode specified by @data in the inode
 * cache. This is a generalized version of ifind_fast() for file systems where
 * the inode number is not sufficient for unique identification of an inode.
 *
 * If the inode is in the cache, the inode is returned with an incremented
 * reference count.
 *
 * Otherwise NULL is returned.
 *
 * Note, @test is called with the inode_lock held, so can't sleep.
 */
1070
static struct inode *ifind(struct super_block *sb,
Linus Torvalds's avatar
Linus Torvalds committed
1071
		struct hlist_head *head, int (*test)(struct inode *, void *),
1072
		void *data, const int wait)
Linus Torvalds's avatar
Linus Torvalds committed
1073 1074 1075 1076 1077 1078 1079
{
	struct inode *inode;

	spin_lock(&inode_lock);
	inode = find_inode(sb, head, test, data);
	if (inode) {
		spin_unlock(&inode_lock);
1080 1081
		if (likely(wait))
			wait_on_inode(inode);
Linus Torvalds's avatar
Linus Torvalds committed
1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102
		return inode;
	}
	spin_unlock(&inode_lock);
	return NULL;
}

/**
 * ifind_fast - internal function, you want ilookup() or iget().
 * @sb:		super block of file system to search
 * @head:       head of the list to search
 * @ino:	inode number to search for
 *
 * ifind_fast() searches for the inode @ino in the inode cache. This is for
 * file systems where the inode number is sufficient for unique identification
 * of an inode.
 *
 * If the inode is in the cache, the inode is returned with an incremented
 * reference count.
 *
 * Otherwise NULL is returned.
 */
1103
static struct inode *ifind_fast(struct super_block *sb,
Linus Torvalds's avatar
Linus Torvalds committed
1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
		struct hlist_head *head, unsigned long ino)
{
	struct inode *inode;

	spin_lock(&inode_lock);
	inode = find_inode_fast(sb, head, ino);
	if (inode) {
		spin_unlock(&inode_lock);
		wait_on_inode(inode);
		return inode;
	}
	spin_unlock(&inode_lock);
	return NULL;
}

/**
1120
 * ilookup5_nowait - search for an inode in the inode cache
Linus Torvalds's avatar
Linus Torvalds committed
1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
 * @sb:		super block of file system to search
 * @hashval:	hash value (usually inode number) to search for
 * @test:	callback used for comparisons between inodes
 * @data:	opaque data pointer to pass to @test
 *
 * ilookup5() uses ifind() to search for the inode specified by @hashval and
 * @data in the inode cache. This is a generalized version of ilookup() for
 * file systems where the inode number is not sufficient for unique
 * identification of an inode.
 *
 * If the inode is in the cache, the inode is returned with an incremented
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162
 * reference count.  Note, the inode lock is not waited upon so you have to be
 * very careful what you do with the returned inode.  You probably should be
 * using ilookup5() instead.
 *
 * Otherwise NULL is returned.
 *
 * Note, @test is called with the inode_lock held, so can't sleep.
 */
struct inode *ilookup5_nowait(struct super_block *sb, unsigned long hashval,
		int (*test)(struct inode *, void *), void *data)
{
	struct hlist_head *head = inode_hashtable + hash(sb, hashval);

	return ifind(sb, head, test, data, 0);
}
EXPORT_SYMBOL(ilookup5_nowait);

/**
 * ilookup5 - search for an inode in the inode cache
 * @sb:		super block of file system to search
 * @hashval:	hash value (usually inode number) to search for
 * @test:	callback used for comparisons between inodes
 * @data:	opaque data pointer to pass to @test
 *
 * ilookup5() uses ifind() to search for the inode specified by @hashval and
 * @data in the inode cache. This is a generalized version of ilookup() for
 * file systems where the inode number is not sufficient for unique
 * identification of an inode.
 *
 * If the inode is in the cache, the inode lock is waited upon and the inode is
 * returned with an incremented reference count.
Linus Torvalds's avatar
Linus Torvalds committed
1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
 *
 * Otherwise NULL is returned.
 *
 * Note, @test is called with the inode_lock held, so can't sleep.
 */
struct inode *ilookup5(struct super_block *sb, unsigned long hashval,
		int (*test)(struct inode *, void *), void *data)
{
	struct hlist_head *head = inode_hashtable + hash(sb, hashval);

1173
	return ifind(sb, head, test, data, 1);
Linus Torvalds's avatar
Linus Torvalds committed
1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184