file_table.c 8.8 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 *  linux/fs/file_table.c
 *
 *  Copyright (C) 1991, 1992  Linus Torvalds
 *  Copyright (C) 1997 David S. Miller (davem@caip.rutgers.edu)
 */

#include <linux/string.h>
#include <linux/slab.h>
#include <linux/file.h>
#include <linux/init.h>
#include <linux/module.h>
#include <linux/fs.h>
#include <linux/security.h>
#include <linux/eventpoll.h>
16
#include <linux/rcupdate.h>
L
Linus Torvalds 已提交
17
#include <linux/mount.h>
18
#include <linux/capability.h>
L
Linus Torvalds 已提交
19
#include <linux/cdev.h>
R
Robert Love 已提交
20
#include <linux/fsnotify.h>
D
Dipankar Sarma 已提交
21 22 23 24
#include <linux/sysctl.h>
#include <linux/percpu_counter.h>

#include <asm/atomic.h>
L
Linus Torvalds 已提交
25 26 27 28 29 30 31

/* sysctl tunables... */
struct files_stat_struct files_stat = {
	.max_files = NR_FILE
};

/* public. Not pretty! */
D
Dipankar Sarma 已提交
32
__cacheline_aligned_in_smp DEFINE_SPINLOCK(files_lock);
L
Linus Torvalds 已提交
33

D
Dipankar Sarma 已提交
34
static struct percpu_counter nr_files __cacheline_aligned_in_smp;
L
Linus Torvalds 已提交
35

D
Dipankar Sarma 已提交
36
static inline void file_free_rcu(struct rcu_head *head)
L
Linus Torvalds 已提交
37
{
D
Dipankar Sarma 已提交
38 39
	struct file *f =  container_of(head, struct file, f_u.fu_rcuhead);
	kmem_cache_free(filp_cachep, f);
L
Linus Torvalds 已提交
40 41
}

D
Dipankar Sarma 已提交
42
static inline void file_free(struct file *f)
L
Linus Torvalds 已提交
43
{
D
Dipankar Sarma 已提交
44 45
	percpu_counter_dec(&nr_files);
	call_rcu(&f->f_u.fu_rcuhead, file_free_rcu);
L
Linus Torvalds 已提交
46 47
}

D
Dipankar Sarma 已提交
48 49 50 51
/*
 * Return the total number of open files in the system
 */
static int get_nr_files(void)
L
Linus Torvalds 已提交
52
{
D
Dipankar Sarma 已提交
53
	return percpu_counter_read_positive(&nr_files);
L
Linus Torvalds 已提交
54 55
}

D
Dipankar Sarma 已提交
56 57 58 59
/*
 * Return the maximum number of open files in the system
 */
int get_max_files(void)
60
{
D
Dipankar Sarma 已提交
61
	return files_stat.max_files;
62
}
D
Dipankar Sarma 已提交
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
EXPORT_SYMBOL_GPL(get_max_files);

/*
 * Handle nr_files sysctl
 */
#if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
int proc_nr_files(ctl_table *table, int write, struct file *filp,
                     void __user *buffer, size_t *lenp, loff_t *ppos)
{
	files_stat.nr_files = get_nr_files();
	return proc_dointvec(table, write, filp, buffer, lenp, ppos);
}
#else
int proc_nr_files(ctl_table *table, int write, struct file *filp,
                     void __user *buffer, size_t *lenp, loff_t *ppos)
{
	return -ENOSYS;
}
#endif
82

L
Linus Torvalds 已提交
83 84 85
/* Find an unused file structure and return a pointer to it.
 * Returns NULL, if there are no more free file structures or
 * we run out of memory.
D
Dave Hansen 已提交
86 87 88 89 90 91
 *
 * Be very careful using this.  You are responsible for
 * getting write access to any mount that you might assign
 * to this filp, if it is opened for write.  If this is not
 * done, you will imbalance int the mount's writer count
 * and a warning at __fput() time.
L
Linus Torvalds 已提交
92 93 94
 */
struct file *get_empty_filp(void)
{
95
	struct task_struct *tsk;
96
	static int old_max;
L
Linus Torvalds 已提交
97 98 99 100 101
	struct file * f;

	/*
	 * Privileged users can go above max_files
	 */
D
Dipankar Sarma 已提交
102 103 104 105 106
	if (get_nr_files() >= files_stat.max_files && !capable(CAP_SYS_ADMIN)) {
		/*
		 * percpu_counters are inaccurate.  Do an expensive check before
		 * we go and fail.
		 */
P
Peter Zijlstra 已提交
107
		if (percpu_counter_sum_positive(&nr_files) >= files_stat.max_files)
D
Dipankar Sarma 已提交
108 109
			goto over;
	}
110

D
Denis Cheng 已提交
111
	f = kmem_cache_zalloc(filp_cachep, GFP_KERNEL);
112 113 114
	if (f == NULL)
		goto fail;

D
Dipankar Sarma 已提交
115
	percpu_counter_inc(&nr_files);
116 117
	if (security_file_alloc(f))
		goto fail_sec;
L
Linus Torvalds 已提交
118

119 120
	tsk = current;
	INIT_LIST_HEAD(&f->f_u.fu_list);
121 122
	atomic_set(&f->f_count, 1);
	rwlock_init(&f->f_owner.lock);
123 124 125
	f->f_uid = tsk->fsuid;
	f->f_gid = tsk->fsgid;
	eventpoll_init_file(f);
126 127 128 129
	/* f->f_version: 0 */
	return f;

over:
L
Linus Torvalds 已提交
130
	/* Ran out of filps - report that */
D
Dipankar Sarma 已提交
131
	if (get_nr_files() > old_max) {
L
Linus Torvalds 已提交
132
		printk(KERN_INFO "VFS: file-max limit %d reached\n",
D
Dipankar Sarma 已提交
133 134
					get_max_files());
		old_max = get_nr_files();
L
Linus Torvalds 已提交
135
	}
136 137 138 139
	goto fail;

fail_sec:
	file_free(f);
L
Linus Torvalds 已提交
140 141 142 143 144 145
fail:
	return NULL;
}

EXPORT_SYMBOL(get_empty_filp);

146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
/**
 * alloc_file - allocate and initialize a 'struct file'
 * @mnt: the vfsmount on which the file will reside
 * @dentry: the dentry representing the new file
 * @mode: the mode with which the new file will be opened
 * @fop: the 'struct file_operations' for the new file
 *
 * Use this instead of get_empty_filp() to get a new
 * 'struct file'.  Do so because of the same initialization
 * pitfalls reasons listed for init_file().  This is a
 * preferred interface to using init_file().
 *
 * If all the callers of init_file() are eliminated, its
 * code should be moved into this function.
 */
struct file *alloc_file(struct vfsmount *mnt, struct dentry *dentry,
		mode_t mode, const struct file_operations *fop)
{
	struct file *file;
	struct path;

	file = get_empty_filp();
	if (!file)
		return NULL;

	init_file(file, mnt, dentry, mode, fop);
	return file;
}
EXPORT_SYMBOL(alloc_file);

/**
 * init_file - initialize a 'struct file'
 * @file: the already allocated 'struct file' to initialized
 * @mnt: the vfsmount on which the file resides
 * @dentry: the dentry representing this file
 * @mode: the mode the file is opened with
 * @fop: the 'struct file_operations' for this file
 *
 * Use this instead of setting the members directly.  Doing so
 * avoids making mistakes like forgetting the mntget() or
 * forgetting to take a write on the mnt.
 *
 * Note: This is a crappy interface.  It is here to make
 * merging with the existing users of get_empty_filp()
 * who have complex failure logic easier.  All users
 * of this should be moving to alloc_file().
 */
int init_file(struct file *file, struct vfsmount *mnt, struct dentry *dentry,
	   mode_t mode, const struct file_operations *fop)
{
	int error = 0;
	file->f_path.dentry = dentry;
	file->f_path.mnt = mntget(mnt);
	file->f_mapping = dentry->d_inode->i_mapping;
	file->f_mode = mode;
	file->f_op = fop;
	return error;
}
EXPORT_SYMBOL(init_file);

206
void fput(struct file *file)
L
Linus Torvalds 已提交
207
{
208
	if (atomic_dec_and_test(&file->f_count))
L
Linus Torvalds 已提交
209 210 211 212 213 214 215 216
		__fput(file);
}

EXPORT_SYMBOL(fput);

/* __fput is called from task context when aio completion releases the last
 * last use of a struct file *.  Do not use otherwise.
 */
217
void __fput(struct file *file)
L
Linus Torvalds 已提交
218
{
219 220
	struct dentry *dentry = file->f_path.dentry;
	struct vfsmount *mnt = file->f_path.mnt;
L
Linus Torvalds 已提交
221 222 223
	struct inode *inode = dentry->d_inode;

	might_sleep();
R
Robert Love 已提交
224 225

	fsnotify_close(file);
L
Linus Torvalds 已提交
226 227 228 229 230 231 232 233 234 235
	/*
	 * The function eventpoll_release() should be the first called
	 * in the file cleanup chain.
	 */
	eventpoll_release(file);
	locks_remove_flock(file);

	if (file->f_op && file->f_op->release)
		file->f_op->release(inode, file);
	security_file_free(file);
236
	if (unlikely(S_ISCHR(inode->i_mode) && inode->i_cdev != NULL))
L
Linus Torvalds 已提交
237 238 239 240
		cdev_put(inode->i_cdev);
	fops_put(file->f_op);
	if (file->f_mode & FMODE_WRITE)
		put_write_access(inode);
241
	put_pid(file->f_owner.pid);
L
Linus Torvalds 已提交
242
	file_kill(file);
243 244
	file->f_path.dentry = NULL;
	file->f_path.mnt = NULL;
L
Linus Torvalds 已提交
245 246 247 248 249
	file_free(file);
	dput(dentry);
	mntput(mnt);
}

250
struct file *fget(unsigned int fd)
L
Linus Torvalds 已提交
251 252 253 254
{
	struct file *file;
	struct files_struct *files = current->files;

255
	rcu_read_lock();
L
Linus Torvalds 已提交
256
	file = fcheck_files(files, fd);
257
	if (file) {
258
		if (!atomic_inc_not_zero(&file->f_count)) {
259 260 261 262 263 264 265
			/* File object ref couldn't be taken */
			rcu_read_unlock();
			return NULL;
		}
	}
	rcu_read_unlock();

L
Linus Torvalds 已提交
266 267 268 269 270 271 272 273 274 275 276 277
	return file;
}

EXPORT_SYMBOL(fget);

/*
 * Lightweight file lookup - no refcnt increment if fd table isn't shared. 
 * You can use this only if it is guranteed that the current task already 
 * holds a refcnt to that file. That check has to be done at fget() only
 * and a flag is returned to be passed to the corresponding fput_light().
 * There must not be a cloning between an fget_light/fput_light pair.
 */
278
struct file *fget_light(unsigned int fd, int *fput_needed)
L
Linus Torvalds 已提交
279 280 281 282 283 284 285 286
{
	struct file *file;
	struct files_struct *files = current->files;

	*fput_needed = 0;
	if (likely((atomic_read(&files->count) == 1))) {
		file = fcheck_files(files, fd);
	} else {
287
		rcu_read_lock();
L
Linus Torvalds 已提交
288 289
		file = fcheck_files(files, fd);
		if (file) {
290
			if (atomic_inc_not_zero(&file->f_count))
291 292 293 294
				*fput_needed = 1;
			else
				/* Didn't get the reference, someone's freed */
				file = NULL;
L
Linus Torvalds 已提交
295
		}
296
		rcu_read_unlock();
L
Linus Torvalds 已提交
297
	}
298

L
Linus Torvalds 已提交
299 300 301 302 303 304
	return file;
}


void put_filp(struct file *file)
{
305
	if (atomic_dec_and_test(&file->f_count)) {
L
Linus Torvalds 已提交
306 307 308 309 310 311 312 313 314 315 316
		security_file_free(file);
		file_kill(file);
		file_free(file);
	}
}

void file_move(struct file *file, struct list_head *list)
{
	if (!list)
		return;
	file_list_lock();
E
Eric Dumazet 已提交
317
	list_move(&file->f_u.fu_list, list);
L
Linus Torvalds 已提交
318 319 320 321 322
	file_list_unlock();
}

void file_kill(struct file *file)
{
E
Eric Dumazet 已提交
323
	if (!list_empty(&file->f_u.fu_list)) {
L
Linus Torvalds 已提交
324
		file_list_lock();
E
Eric Dumazet 已提交
325
		list_del_init(&file->f_u.fu_list);
L
Linus Torvalds 已提交
326 327 328 329 330 331
		file_list_unlock();
	}
}

int fs_may_remount_ro(struct super_block *sb)
{
332
	struct file *file;
L
Linus Torvalds 已提交
333 334 335

	/* Check that no files are currently opened for writing. */
	file_list_lock();
336
	list_for_each_entry(file, &sb->s_files, f_u.fu_list) {
337
		struct inode *inode = file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364

		/* File with pending delete? */
		if (inode->i_nlink == 0)
			goto too_bad;

		/* Writeable file? */
		if (S_ISREG(inode->i_mode) && (file->f_mode & FMODE_WRITE))
			goto too_bad;
	}
	file_list_unlock();
	return 1; /* Tis' cool bro. */
too_bad:
	file_list_unlock();
	return 0;
}

void __init files_init(unsigned long mempages)
{ 
	int n; 
	/* One file with associated inode and dcache is very roughly 1K. 
	 * Per default don't use more than 10% of our memory for files. 
	 */ 

	n = (mempages * (PAGE_SIZE / 1024)) / 10;
	files_stat.max_files = n; 
	if (files_stat.max_files < NR_FILE)
		files_stat.max_files = NR_FILE;
365
	files_defer_init();
366
	percpu_counter_init(&nr_files, 0);
L
Linus Torvalds 已提交
367
}