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