xref: /linux/fs/file_table.c (revision 5b9b41617bf3e1282cc60f07d3d52e62399aa4ba)
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3  *  linux/fs/file_table.c
4  *
5  *  Copyright (C) 1991, 1992  Linus Torvalds
6  *  Copyright (C) 1997 David S. Miller (davem@caip.rutgers.edu)
7  */
8 
9 #include <linux/string.h>
10 #include <linux/slab.h>
11 #include <linux/file.h>
12 #include <linux/fdtable.h>
13 #include <linux/init.h>
14 #include <linux/module.h>
15 #include <linux/fs.h>
16 #include <linux/filelock.h>
17 #include <linux/security.h>
18 #include <linux/cred.h>
19 #include <linux/eventpoll.h>
20 #include <linux/rcupdate.h>
21 #include <linux/mount.h>
22 #include <linux/capability.h>
23 #include <linux/cdev.h>
24 #include <linux/fsnotify.h>
25 #include <linux/sysctl.h>
26 #include <linux/percpu_counter.h>
27 #include <linux/percpu.h>
28 #include <linux/task_work.h>
29 #include <linux/ima.h>
30 #include <linux/swap.h>
31 #include <linux/kmemleak.h>
32 
33 #include <linux/atomic.h>
34 
35 #include "internal.h"
36 
37 /* sysctl tunables... */
38 static struct files_stat_struct files_stat = {
39 	.max_files = NR_FILE
40 };
41 
42 /* SLAB cache for file structures */
43 static struct kmem_cache *filp_cachep __ro_after_init;
44 
45 static struct percpu_counter nr_files __cacheline_aligned_in_smp;
46 
47 /* Container for backing file with optional user path */
48 struct backing_file {
49 	struct file file;
50 	struct path user_path;
51 };
52 
53 static inline struct backing_file *backing_file(struct file *f)
54 {
55 	return container_of(f, struct backing_file, file);
56 }
57 
58 struct path *backing_file_user_path(struct file *f)
59 {
60 	return &backing_file(f)->user_path;
61 }
62 EXPORT_SYMBOL_GPL(backing_file_user_path);
63 
64 static inline void file_free(struct file *f)
65 {
66 	security_file_free(f);
67 	if (likely(!(f->f_mode & FMODE_NOACCOUNT)))
68 		percpu_counter_dec(&nr_files);
69 	put_cred(f->f_cred);
70 	if (unlikely(f->f_mode & FMODE_BACKING)) {
71 		path_put(backing_file_user_path(f));
72 		kfree(backing_file(f));
73 	} else {
74 		kmem_cache_free(filp_cachep, f);
75 	}
76 }
77 
78 /*
79  * Return the total number of open files in the system
80  */
81 static long get_nr_files(void)
82 {
83 	return percpu_counter_read_positive(&nr_files);
84 }
85 
86 /*
87  * Return the maximum number of open files in the system
88  */
89 unsigned long get_max_files(void)
90 {
91 	return files_stat.max_files;
92 }
93 EXPORT_SYMBOL_GPL(get_max_files);
94 
95 #if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
96 
97 /*
98  * Handle nr_files sysctl
99  */
100 static int proc_nr_files(struct ctl_table *table, int write, void *buffer,
101 			 size_t *lenp, loff_t *ppos)
102 {
103 	files_stat.nr_files = get_nr_files();
104 	return proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
105 }
106 
107 static struct ctl_table fs_stat_sysctls[] = {
108 	{
109 		.procname	= "file-nr",
110 		.data		= &files_stat,
111 		.maxlen		= sizeof(files_stat),
112 		.mode		= 0444,
113 		.proc_handler	= proc_nr_files,
114 	},
115 	{
116 		.procname	= "file-max",
117 		.data		= &files_stat.max_files,
118 		.maxlen		= sizeof(files_stat.max_files),
119 		.mode		= 0644,
120 		.proc_handler	= proc_doulongvec_minmax,
121 		.extra1		= SYSCTL_LONG_ZERO,
122 		.extra2		= SYSCTL_LONG_MAX,
123 	},
124 	{
125 		.procname	= "nr_open",
126 		.data		= &sysctl_nr_open,
127 		.maxlen		= sizeof(unsigned int),
128 		.mode		= 0644,
129 		.proc_handler	= proc_dointvec_minmax,
130 		.extra1		= &sysctl_nr_open_min,
131 		.extra2		= &sysctl_nr_open_max,
132 	},
133 };
134 
135 static int __init init_fs_stat_sysctls(void)
136 {
137 	register_sysctl_init("fs", fs_stat_sysctls);
138 	if (IS_ENABLED(CONFIG_BINFMT_MISC)) {
139 		struct ctl_table_header *hdr;
140 		hdr = register_sysctl_mount_point("fs/binfmt_misc");
141 		kmemleak_not_leak(hdr);
142 	}
143 	return 0;
144 }
145 fs_initcall(init_fs_stat_sysctls);
146 #endif
147 
148 static int init_file(struct file *f, int flags, const struct cred *cred)
149 {
150 	int error;
151 
152 	f->f_cred = get_cred(cred);
153 	error = security_file_alloc(f);
154 	if (unlikely(error)) {
155 		put_cred(f->f_cred);
156 		return error;
157 	}
158 
159 	rwlock_init(&f->f_owner.lock);
160 	spin_lock_init(&f->f_lock);
161 	mutex_init(&f->f_pos_lock);
162 	f->f_flags = flags;
163 	f->f_mode = OPEN_FMODE(flags);
164 	/* f->f_version: 0 */
165 
166 	/*
167 	 * We're SLAB_TYPESAFE_BY_RCU so initialize f_count last. While
168 	 * fget-rcu pattern users need to be able to handle spurious
169 	 * refcount bumps we should reinitialize the reused file first.
170 	 */
171 	atomic_long_set(&f->f_count, 1);
172 	return 0;
173 }
174 
175 /* Find an unused file structure and return a pointer to it.
176  * Returns an error pointer if some error happend e.g. we over file
177  * structures limit, run out of memory or operation is not permitted.
178  *
179  * Be very careful using this.  You are responsible for
180  * getting write access to any mount that you might assign
181  * to this filp, if it is opened for write.  If this is not
182  * done, you will imbalance int the mount's writer count
183  * and a warning at __fput() time.
184  */
185 struct file *alloc_empty_file(int flags, const struct cred *cred)
186 {
187 	static long old_max;
188 	struct file *f;
189 	int error;
190 
191 	/*
192 	 * Privileged users can go above max_files
193 	 */
194 	if (get_nr_files() >= files_stat.max_files && !capable(CAP_SYS_ADMIN)) {
195 		/*
196 		 * percpu_counters are inaccurate.  Do an expensive check before
197 		 * we go and fail.
198 		 */
199 		if (percpu_counter_sum_positive(&nr_files) >= files_stat.max_files)
200 			goto over;
201 	}
202 
203 	f = kmem_cache_zalloc(filp_cachep, GFP_KERNEL);
204 	if (unlikely(!f))
205 		return ERR_PTR(-ENOMEM);
206 
207 	error = init_file(f, flags, cred);
208 	if (unlikely(error)) {
209 		kmem_cache_free(filp_cachep, f);
210 		return ERR_PTR(error);
211 	}
212 
213 	percpu_counter_inc(&nr_files);
214 
215 	return f;
216 
217 over:
218 	/* Ran out of filps - report that */
219 	if (get_nr_files() > old_max) {
220 		pr_info("VFS: file-max limit %lu reached\n", get_max_files());
221 		old_max = get_nr_files();
222 	}
223 	return ERR_PTR(-ENFILE);
224 }
225 
226 /*
227  * Variant of alloc_empty_file() that doesn't check and modify nr_files.
228  *
229  * This is only for kernel internal use, and the allocate file must not be
230  * installed into file tables or such.
231  */
232 struct file *alloc_empty_file_noaccount(int flags, const struct cred *cred)
233 {
234 	struct file *f;
235 	int error;
236 
237 	f = kmem_cache_zalloc(filp_cachep, GFP_KERNEL);
238 	if (unlikely(!f))
239 		return ERR_PTR(-ENOMEM);
240 
241 	error = init_file(f, flags, cred);
242 	if (unlikely(error)) {
243 		kmem_cache_free(filp_cachep, f);
244 		return ERR_PTR(error);
245 	}
246 
247 	f->f_mode |= FMODE_NOACCOUNT;
248 
249 	return f;
250 }
251 
252 /*
253  * Variant of alloc_empty_file() that allocates a backing_file container
254  * and doesn't check and modify nr_files.
255  *
256  * This is only for kernel internal use, and the allocate file must not be
257  * installed into file tables or such.
258  */
259 struct file *alloc_empty_backing_file(int flags, const struct cred *cred)
260 {
261 	struct backing_file *ff;
262 	int error;
263 
264 	ff = kzalloc(sizeof(struct backing_file), GFP_KERNEL);
265 	if (unlikely(!ff))
266 		return ERR_PTR(-ENOMEM);
267 
268 	error = init_file(&ff->file, flags, cred);
269 	if (unlikely(error)) {
270 		kfree(ff);
271 		return ERR_PTR(error);
272 	}
273 
274 	ff->file.f_mode |= FMODE_BACKING | FMODE_NOACCOUNT;
275 	return &ff->file;
276 }
277 
278 /**
279  * alloc_file - allocate and initialize a 'struct file'
280  *
281  * @path: the (dentry, vfsmount) pair for the new file
282  * @flags: O_... flags with which the new file will be opened
283  * @fop: the 'struct file_operations' for the new file
284  */
285 static struct file *alloc_file(const struct path *path, int flags,
286 		const struct file_operations *fop)
287 {
288 	struct file *file;
289 
290 	file = alloc_empty_file(flags, current_cred());
291 	if (IS_ERR(file))
292 		return file;
293 
294 	file->f_path = *path;
295 	file->f_inode = path->dentry->d_inode;
296 	file->f_mapping = path->dentry->d_inode->i_mapping;
297 	file->f_wb_err = filemap_sample_wb_err(file->f_mapping);
298 	file->f_sb_err = file_sample_sb_err(file);
299 	if (fop->llseek)
300 		file->f_mode |= FMODE_LSEEK;
301 	if ((file->f_mode & FMODE_READ) &&
302 	     likely(fop->read || fop->read_iter))
303 		file->f_mode |= FMODE_CAN_READ;
304 	if ((file->f_mode & FMODE_WRITE) &&
305 	     likely(fop->write || fop->write_iter))
306 		file->f_mode |= FMODE_CAN_WRITE;
307 	file->f_iocb_flags = iocb_flags(file);
308 	file->f_mode |= FMODE_OPENED;
309 	file->f_op = fop;
310 	if ((file->f_mode & (FMODE_READ | FMODE_WRITE)) == FMODE_READ)
311 		i_readcount_inc(path->dentry->d_inode);
312 	return file;
313 }
314 
315 struct file *alloc_file_pseudo(struct inode *inode, struct vfsmount *mnt,
316 				const char *name, int flags,
317 				const struct file_operations *fops)
318 {
319 	static const struct dentry_operations anon_ops = {
320 		.d_dname = simple_dname
321 	};
322 	struct qstr this = QSTR_INIT(name, strlen(name));
323 	struct path path;
324 	struct file *file;
325 
326 	path.dentry = d_alloc_pseudo(mnt->mnt_sb, &this);
327 	if (!path.dentry)
328 		return ERR_PTR(-ENOMEM);
329 	if (!mnt->mnt_sb->s_d_op)
330 		d_set_d_op(path.dentry, &anon_ops);
331 	path.mnt = mntget(mnt);
332 	d_instantiate(path.dentry, inode);
333 	file = alloc_file(&path, flags, fops);
334 	if (IS_ERR(file)) {
335 		ihold(inode);
336 		path_put(&path);
337 	}
338 	return file;
339 }
340 EXPORT_SYMBOL(alloc_file_pseudo);
341 
342 struct file *alloc_file_clone(struct file *base, int flags,
343 				const struct file_operations *fops)
344 {
345 	struct file *f = alloc_file(&base->f_path, flags, fops);
346 	if (!IS_ERR(f)) {
347 		path_get(&f->f_path);
348 		f->f_mapping = base->f_mapping;
349 	}
350 	return f;
351 }
352 
353 /* the real guts of fput() - releasing the last reference to file
354  */
355 static void __fput(struct file *file)
356 {
357 	struct dentry *dentry = file->f_path.dentry;
358 	struct vfsmount *mnt = file->f_path.mnt;
359 	struct inode *inode = file->f_inode;
360 	fmode_t mode = file->f_mode;
361 
362 	if (unlikely(!(file->f_mode & FMODE_OPENED)))
363 		goto out;
364 
365 	might_sleep();
366 
367 	fsnotify_close(file);
368 	/*
369 	 * The function eventpoll_release() should be the first called
370 	 * in the file cleanup chain.
371 	 */
372 	eventpoll_release(file);
373 	locks_remove_file(file);
374 
375 	ima_file_free(file);
376 	if (unlikely(file->f_flags & FASYNC)) {
377 		if (file->f_op->fasync)
378 			file->f_op->fasync(-1, file, 0);
379 	}
380 	if (file->f_op->release)
381 		file->f_op->release(inode, file);
382 	if (unlikely(S_ISCHR(inode->i_mode) && inode->i_cdev != NULL &&
383 		     !(mode & FMODE_PATH))) {
384 		cdev_put(inode->i_cdev);
385 	}
386 	fops_put(file->f_op);
387 	put_pid(file->f_owner.pid);
388 	put_file_access(file);
389 	dput(dentry);
390 	if (unlikely(mode & FMODE_NEED_UNMOUNT))
391 		dissolve_on_fput(mnt);
392 	mntput(mnt);
393 out:
394 	file_free(file);
395 }
396 
397 static LLIST_HEAD(delayed_fput_list);
398 static void delayed_fput(struct work_struct *unused)
399 {
400 	struct llist_node *node = llist_del_all(&delayed_fput_list);
401 	struct file *f, *t;
402 
403 	llist_for_each_entry_safe(f, t, node, f_llist)
404 		__fput(f);
405 }
406 
407 static void ____fput(struct callback_head *work)
408 {
409 	__fput(container_of(work, struct file, f_task_work));
410 }
411 
412 /*
413  * If kernel thread really needs to have the final fput() it has done
414  * to complete, call this.  The only user right now is the boot - we
415  * *do* need to make sure our writes to binaries on initramfs has
416  * not left us with opened struct file waiting for __fput() - execve()
417  * won't work without that.  Please, don't add more callers without
418  * very good reasons; in particular, never call that with locks
419  * held and never call that from a thread that might need to do
420  * some work on any kind of umount.
421  */
422 void flush_delayed_fput(void)
423 {
424 	delayed_fput(NULL);
425 }
426 EXPORT_SYMBOL_GPL(flush_delayed_fput);
427 
428 static DECLARE_DELAYED_WORK(delayed_fput_work, delayed_fput);
429 
430 void fput(struct file *file)
431 {
432 	if (atomic_long_dec_and_test(&file->f_count)) {
433 		struct task_struct *task = current;
434 
435 		if (unlikely(!(file->f_mode & (FMODE_BACKING | FMODE_OPENED)))) {
436 			file_free(file);
437 			return;
438 		}
439 		if (likely(!in_interrupt() && !(task->flags & PF_KTHREAD))) {
440 			init_task_work(&file->f_task_work, ____fput);
441 			if (!task_work_add(task, &file->f_task_work, TWA_RESUME))
442 				return;
443 			/*
444 			 * After this task has run exit_task_work(),
445 			 * task_work_add() will fail.  Fall through to delayed
446 			 * fput to avoid leaking *file.
447 			 */
448 		}
449 
450 		if (llist_add(&file->f_llist, &delayed_fput_list))
451 			schedule_delayed_work(&delayed_fput_work, 1);
452 	}
453 }
454 
455 /*
456  * synchronous analog of fput(); for kernel threads that might be needed
457  * in some umount() (and thus can't use flush_delayed_fput() without
458  * risking deadlocks), need to wait for completion of __fput() and know
459  * for this specific struct file it won't involve anything that would
460  * need them.  Use only if you really need it - at the very least,
461  * don't blindly convert fput() by kernel thread to that.
462  */
463 void __fput_sync(struct file *file)
464 {
465 	if (atomic_long_dec_and_test(&file->f_count))
466 		__fput(file);
467 }
468 
469 EXPORT_SYMBOL(fput);
470 EXPORT_SYMBOL(__fput_sync);
471 
472 void __init files_init(void)
473 {
474 	filp_cachep = kmem_cache_create("filp", sizeof(struct file), 0,
475 				SLAB_TYPESAFE_BY_RCU | SLAB_HWCACHE_ALIGN |
476 				SLAB_PANIC | SLAB_ACCOUNT, NULL);
477 	percpu_counter_init(&nr_files, 0, GFP_KERNEL);
478 }
479 
480 /*
481  * One file with associated inode and dcache is very roughly 1K. Per default
482  * do not use more than 10% of our memory for files.
483  */
484 void __init files_maxfiles_init(void)
485 {
486 	unsigned long n;
487 	unsigned long nr_pages = totalram_pages();
488 	unsigned long memreserve = (nr_pages - nr_free_pages()) * 3/2;
489 
490 	memreserve = min(memreserve, nr_pages - 1);
491 	n = ((nr_pages - memreserve) * (PAGE_SIZE / 1024)) / 10;
492 
493 	files_stat.max_files = max_t(unsigned long, n, NR_FILE);
494 }
495