]> bbs.cooldavid.org Git - net-next-2.6.git/blame - fs/file_table.c
fs: remove extra lookup in __lookup_hash
[net-next-2.6.git] / fs / file_table.c
CommitLineData
1da177e4
LT
1/*
2 * linux/fs/file_table.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 * Copyright (C) 1997 David S. Miller (davem@caip.rutgers.edu)
6 */
7
8#include <linux/string.h>
9#include <linux/slab.h>
10#include <linux/file.h>
9f3acc31 11#include <linux/fdtable.h>
1da177e4
LT
12#include <linux/init.h>
13#include <linux/module.h>
1da177e4
LT
14#include <linux/fs.h>
15#include <linux/security.h>
16#include <linux/eventpoll.h>
ab2af1f5 17#include <linux/rcupdate.h>
1da177e4 18#include <linux/mount.h>
16f7e0fe 19#include <linux/capability.h>
1da177e4 20#include <linux/cdev.h>
0eeca283 21#include <linux/fsnotify.h>
529bf6be
DS
22#include <linux/sysctl.h>
23#include <linux/percpu_counter.h>
0552f879 24#include <linux/ima.h>
529bf6be
DS
25
26#include <asm/atomic.h>
1da177e4 27
e81e3f4d
EP
28#include "internal.h"
29
1da177e4
LT
30/* sysctl tunables... */
31struct files_stat_struct files_stat = {
32 .max_files = NR_FILE
33};
34
1da177e4 35/* public. Not pretty! */
529bf6be 36__cacheline_aligned_in_smp DEFINE_SPINLOCK(files_lock);
1da177e4 37
b6b3fdea
ED
38/* SLAB cache for file structures */
39static struct kmem_cache *filp_cachep __read_mostly;
40
529bf6be 41static struct percpu_counter nr_files __cacheline_aligned_in_smp;
1da177e4 42
529bf6be 43static inline void file_free_rcu(struct rcu_head *head)
1da177e4 44{
d76b0d9b
DH
45 struct file *f = container_of(head, struct file, f_u.fu_rcuhead);
46
47 put_cred(f->f_cred);
529bf6be 48 kmem_cache_free(filp_cachep, f);
1da177e4
LT
49}
50
529bf6be 51static inline void file_free(struct file *f)
1da177e4 52{
529bf6be 53 percpu_counter_dec(&nr_files);
ad775f5a 54 file_check_state(f);
529bf6be 55 call_rcu(&f->f_u.fu_rcuhead, file_free_rcu);
1da177e4
LT
56}
57
529bf6be
DS
58/*
59 * Return the total number of open files in the system
60 */
61static int get_nr_files(void)
1da177e4 62{
529bf6be 63 return percpu_counter_read_positive(&nr_files);
1da177e4
LT
64}
65
529bf6be
DS
66/*
67 * Return the maximum number of open files in the system
68 */
69int get_max_files(void)
ab2af1f5 70{
529bf6be 71 return files_stat.max_files;
ab2af1f5 72}
529bf6be
DS
73EXPORT_SYMBOL_GPL(get_max_files);
74
75/*
76 * Handle nr_files sysctl
77 */
78#if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
8d65af78 79int proc_nr_files(ctl_table *table, int write,
529bf6be
DS
80 void __user *buffer, size_t *lenp, loff_t *ppos)
81{
82 files_stat.nr_files = get_nr_files();
8d65af78 83 return proc_dointvec(table, write, buffer, lenp, ppos);
529bf6be
DS
84}
85#else
8d65af78 86int proc_nr_files(ctl_table *table, int write,
529bf6be
DS
87 void __user *buffer, size_t *lenp, loff_t *ppos)
88{
89 return -ENOSYS;
90}
91#endif
ab2af1f5 92
1da177e4
LT
93/* Find an unused file structure and return a pointer to it.
94 * Returns NULL, if there are no more free file structures or
95 * we run out of memory.
430e285e
DH
96 *
97 * Be very careful using this. You are responsible for
98 * getting write access to any mount that you might assign
99 * to this filp, if it is opened for write. If this is not
100 * done, you will imbalance int the mount's writer count
101 * and a warning at __fput() time.
1da177e4
LT
102 */
103struct file *get_empty_filp(void)
104{
86a264ab 105 const struct cred *cred = current_cred();
af4d2ecb 106 static int old_max;
1da177e4
LT
107 struct file * f;
108
109 /*
110 * Privileged users can go above max_files
111 */
529bf6be
DS
112 if (get_nr_files() >= files_stat.max_files && !capable(CAP_SYS_ADMIN)) {
113 /*
114 * percpu_counters are inaccurate. Do an expensive check before
115 * we go and fail.
116 */
52d9f3b4 117 if (percpu_counter_sum_positive(&nr_files) >= files_stat.max_files)
529bf6be
DS
118 goto over;
119 }
af4d2ecb 120
4975e45f 121 f = kmem_cache_zalloc(filp_cachep, GFP_KERNEL);
af4d2ecb
KK
122 if (f == NULL)
123 goto fail;
124
529bf6be 125 percpu_counter_inc(&nr_files);
af4d2ecb
KK
126 if (security_file_alloc(f))
127 goto fail_sec;
1da177e4 128
5a6b7951 129 INIT_LIST_HEAD(&f->f_u.fu_list);
516e0cc5 130 atomic_long_set(&f->f_count, 1);
af4d2ecb 131 rwlock_init(&f->f_owner.lock);
d76b0d9b 132 f->f_cred = get_cred(cred);
68499914 133 spin_lock_init(&f->f_lock);
5a6b7951 134 eventpoll_init_file(f);
af4d2ecb 135 /* f->f_version: 0 */
af4d2ecb
KK
136 return f;
137
138over:
1da177e4 139 /* Ran out of filps - report that */
529bf6be 140 if (get_nr_files() > old_max) {
1da177e4 141 printk(KERN_INFO "VFS: file-max limit %d reached\n",
529bf6be
DS
142 get_max_files());
143 old_max = get_nr_files();
1da177e4 144 }
af4d2ecb
KK
145 goto fail;
146
147fail_sec:
148 file_free(f);
1da177e4
LT
149fail:
150 return NULL;
151}
152
ce8d2cdf
DH
153/**
154 * alloc_file - allocate and initialize a 'struct file'
155 * @mnt: the vfsmount on which the file will reside
156 * @dentry: the dentry representing the new file
157 * @mode: the mode with which the new file will be opened
158 * @fop: the 'struct file_operations' for the new file
159 *
160 * Use this instead of get_empty_filp() to get a new
161 * 'struct file'. Do so because of the same initialization
162 * pitfalls reasons listed for init_file(). This is a
163 * preferred interface to using init_file().
164 *
165 * If all the callers of init_file() are eliminated, its
166 * code should be moved into this function.
167 */
2c48b9c4
AV
168struct file *alloc_file(struct path *path, fmode_t mode,
169 const struct file_operations *fop)
ce8d2cdf
DH
170{
171 struct file *file;
ce8d2cdf
DH
172
173 file = get_empty_filp();
174 if (!file)
175 return NULL;
176
2c48b9c4
AV
177 file->f_path = *path;
178 file->f_mapping = path->dentry->d_inode->i_mapping;
ce8d2cdf
DH
179 file->f_mode = mode;
180 file->f_op = fop;
4a3fd211
DH
181
182 /*
183 * These mounts don't really matter in practice
184 * for r/o bind mounts. They aren't userspace-
185 * visible. We do this for consistency, and so
186 * that we can do debugging checks at __fput()
187 */
2c48b9c4 188 if ((mode & FMODE_WRITE) && !special_file(path->dentry->d_inode->i_mode)) {
ad775f5a 189 file_take_write(file);
385e3ed4 190 WARN_ON(mnt_clone_write(path->mnt));
4a3fd211 191 }
0552f879 192 ima_counts_get(file);
3d1e4631 193 return file;
ce8d2cdf 194}
73efc468 195EXPORT_SYMBOL(alloc_file);
ce8d2cdf 196
aceaf78d
DH
197/**
198 * drop_file_write_access - give up ability to write to a file
199 * @file: the file to which we will stop writing
200 *
201 * This is a central place which will give up the ability
202 * to write to @file, along with access to write through
203 * its vfsmount.
204 */
205void drop_file_write_access(struct file *file)
206{
4a3fd211 207 struct vfsmount *mnt = file->f_path.mnt;
aceaf78d
DH
208 struct dentry *dentry = file->f_path.dentry;
209 struct inode *inode = dentry->d_inode;
210
211 put_write_access(inode);
ad775f5a
DH
212
213 if (special_file(inode->i_mode))
214 return;
215 if (file_check_writeable(file) != 0)
216 return;
217 mnt_drop_write(mnt);
218 file_release_write(file);
aceaf78d
DH
219}
220EXPORT_SYMBOL_GPL(drop_file_write_access);
221
d7065da0 222/* the real guts of fput() - releasing the last reference to file
1da177e4 223 */
d7065da0 224static void __fput(struct file *file)
1da177e4 225{
0f7fc9e4
JJS
226 struct dentry *dentry = file->f_path.dentry;
227 struct vfsmount *mnt = file->f_path.mnt;
1da177e4
LT
228 struct inode *inode = dentry->d_inode;
229
230 might_sleep();
0eeca283
RL
231
232 fsnotify_close(file);
1da177e4
LT
233 /*
234 * The function eventpoll_release() should be the first called
235 * in the file cleanup chain.
236 */
237 eventpoll_release(file);
238 locks_remove_flock(file);
239
233e70f4
AV
240 if (unlikely(file->f_flags & FASYNC)) {
241 if (file->f_op && file->f_op->fasync)
242 file->f_op->fasync(-1, file, 0);
243 }
1da177e4
LT
244 if (file->f_op && file->f_op->release)
245 file->f_op->release(inode, file);
246 security_file_free(file);
89068c57 247 ima_file_free(file);
577c4eb0 248 if (unlikely(S_ISCHR(inode->i_mode) && inode->i_cdev != NULL))
1da177e4
LT
249 cdev_put(inode->i_cdev);
250 fops_put(file->f_op);
609d7fa9 251 put_pid(file->f_owner.pid);
1da177e4 252 file_kill(file);
aceaf78d
DH
253 if (file->f_mode & FMODE_WRITE)
254 drop_file_write_access(file);
0f7fc9e4
JJS
255 file->f_path.dentry = NULL;
256 file->f_path.mnt = NULL;
1da177e4
LT
257 file_free(file);
258 dput(dentry);
259 mntput(mnt);
260}
261
d7065da0
AV
262void fput(struct file *file)
263{
264 if (atomic_long_dec_and_test(&file->f_count))
265 __fput(file);
266}
267
268EXPORT_SYMBOL(fput);
269
fc9b52cd 270struct file *fget(unsigned int fd)
1da177e4
LT
271{
272 struct file *file;
273 struct files_struct *files = current->files;
274
ab2af1f5 275 rcu_read_lock();
1da177e4 276 file = fcheck_files(files, fd);
ab2af1f5 277 if (file) {
516e0cc5 278 if (!atomic_long_inc_not_zero(&file->f_count)) {
ab2af1f5
DS
279 /* File object ref couldn't be taken */
280 rcu_read_unlock();
281 return NULL;
282 }
283 }
284 rcu_read_unlock();
285
1da177e4
LT
286 return file;
287}
288
289EXPORT_SYMBOL(fget);
290
291/*
58939473
TB
292 * Lightweight file lookup - no refcnt increment if fd table isn't shared.
293 *
294 * You can use this instead of fget if you satisfy all of the following
295 * conditions:
296 * 1) You must call fput_light before exiting the syscall and returning control
297 * to userspace (i.e. you cannot remember the returned struct file * after
298 * returning to userspace).
299 * 2) You must not call filp_close on the returned struct file * in between
300 * calls to fget_light and fput_light.
301 * 3) You must not clone the current task in between the calls to fget_light
302 * and fput_light.
303 *
304 * The fput_needed flag returned by fget_light should be passed to the
305 * corresponding fput_light.
1da177e4 306 */
fc9b52cd 307struct file *fget_light(unsigned int fd, int *fput_needed)
1da177e4
LT
308{
309 struct file *file;
310 struct files_struct *files = current->files;
311
312 *fput_needed = 0;
313 if (likely((atomic_read(&files->count) == 1))) {
314 file = fcheck_files(files, fd);
315 } else {
ab2af1f5 316 rcu_read_lock();
1da177e4
LT
317 file = fcheck_files(files, fd);
318 if (file) {
516e0cc5 319 if (atomic_long_inc_not_zero(&file->f_count))
ab2af1f5
DS
320 *fput_needed = 1;
321 else
322 /* Didn't get the reference, someone's freed */
323 file = NULL;
1da177e4 324 }
ab2af1f5 325 rcu_read_unlock();
1da177e4 326 }
ab2af1f5 327
1da177e4
LT
328 return file;
329}
330
331
332void put_filp(struct file *file)
333{
516e0cc5 334 if (atomic_long_dec_and_test(&file->f_count)) {
1da177e4
LT
335 security_file_free(file);
336 file_kill(file);
337 file_free(file);
338 }
339}
340
341void file_move(struct file *file, struct list_head *list)
342{
343 if (!list)
344 return;
345 file_list_lock();
2f512016 346 list_move(&file->f_u.fu_list, list);
1da177e4
LT
347 file_list_unlock();
348}
349
350void file_kill(struct file *file)
351{
2f512016 352 if (!list_empty(&file->f_u.fu_list)) {
1da177e4 353 file_list_lock();
2f512016 354 list_del_init(&file->f_u.fu_list);
1da177e4
LT
355 file_list_unlock();
356 }
357}
358
359int fs_may_remount_ro(struct super_block *sb)
360{
cfdaf9e5 361 struct file *file;
1da177e4
LT
362
363 /* Check that no files are currently opened for writing. */
364 file_list_lock();
cfdaf9e5 365 list_for_each_entry(file, &sb->s_files, f_u.fu_list) {
0f7fc9e4 366 struct inode *inode = file->f_path.dentry->d_inode;
1da177e4
LT
367
368 /* File with pending delete? */
369 if (inode->i_nlink == 0)
370 goto too_bad;
371
372 /* Writeable file? */
373 if (S_ISREG(inode->i_mode) && (file->f_mode & FMODE_WRITE))
374 goto too_bad;
375 }
376 file_list_unlock();
377 return 1; /* Tis' cool bro. */
378too_bad:
379 file_list_unlock();
380 return 0;
381}
382
864d7c4c 383/**
384 * mark_files_ro - mark all files read-only
385 * @sb: superblock in question
386 *
387 * All files are marked read-only. We don't care about pending
388 * delete files so this should be used in 'force' mode only.
389 */
390void mark_files_ro(struct super_block *sb)
391{
392 struct file *f;
393
394retry:
395 file_list_lock();
396 list_for_each_entry(f, &sb->s_files, f_u.fu_list) {
397 struct vfsmount *mnt;
398 if (!S_ISREG(f->f_path.dentry->d_inode->i_mode))
399 continue;
400 if (!file_count(f))
401 continue;
402 if (!(f->f_mode & FMODE_WRITE))
403 continue;
42e49608 404 spin_lock(&f->f_lock);
864d7c4c 405 f->f_mode &= ~FMODE_WRITE;
42e49608 406 spin_unlock(&f->f_lock);
864d7c4c 407 if (file_check_writeable(f) != 0)
408 continue;
409 file_release_write(f);
410 mnt = mntget(f->f_path.mnt);
411 file_list_unlock();
412 /*
413 * This can sleep, so we can't hold
414 * the file_list_lock() spinlock.
415 */
416 mnt_drop_write(mnt);
417 mntput(mnt);
418 goto retry;
419 }
420 file_list_unlock();
421}
422
1da177e4
LT
423void __init files_init(unsigned long mempages)
424{
425 int n;
b6b3fdea
ED
426
427 filp_cachep = kmem_cache_create("filp", sizeof(struct file), 0,
428 SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL);
429
430 /*
431 * One file with associated inode and dcache is very roughly 1K.
1da177e4
LT
432 * Per default don't use more than 10% of our memory for files.
433 */
434
435 n = (mempages * (PAGE_SIZE / 1024)) / 10;
436 files_stat.max_files = n;
437 if (files_stat.max_files < NR_FILE)
438 files_stat.max_files = NR_FILE;
ab2af1f5 439 files_defer_init();
0216bfcf 440 percpu_counter_init(&nr_files, 0);
1da177e4 441}