file_table.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  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. #include <linux/string.h>
  8. #include <linux/slab.h>
  9. #include <linux/file.h>
  10. #include <linux/fdtable.h>
  11. #include <linux/init.h>
  12. #include <linux/module.h>
  13. #include <linux/fs.h>
  14. #include <linux/security.h>
  15. #include <linux/cred.h>
  16. #include <linux/eventpoll.h>
  17. #include <linux/rcupdate.h>
  18. #include <linux/mount.h>
  19. #include <linux/capability.h>
  20. #include <linux/cdev.h>
  21. #include <linux/fsnotify.h>
  22. #include <linux/sysctl.h>
  23. #include <linux/percpu_counter.h>
  24. #include <linux/percpu.h>
  25. #include <linux/task_work.h>
  26. #include <linux/ima.h>
  27. #include <linux/swap.h>
  28. #include <linux/atomic.h>
  29. #include "internal.h"
  30. /* sysctl tunables... */
  31. struct files_stat_struct files_stat = {
  32. .max_files = NR_FILE
  33. };
  34. /* SLAB cache for file structures */
  35. static struct kmem_cache *filp_cachep __read_mostly;
  36. static struct percpu_counter nr_files __cacheline_aligned_in_smp;
  37. static void file_free_rcu(struct rcu_head *head)
  38. {
  39. struct file *f = container_of(head, struct file, f_u.fu_rcuhead);
  40. put_cred(f->f_cred);
  41. kmem_cache_free(filp_cachep, f);
  42. }
  43. static inline void file_free(struct file *f)
  44. {
  45. security_file_free(f);
  46. percpu_counter_dec(&nr_files);
  47. call_rcu(&f->f_u.fu_rcuhead, file_free_rcu);
  48. }
  49. /*
  50. * Return the total number of open files in the system
  51. */
  52. static long get_nr_files(void)
  53. {
  54. return percpu_counter_read_positive(&nr_files);
  55. }
  56. /*
  57. * Return the maximum number of open files in the system
  58. */
  59. unsigned long get_max_files(void)
  60. {
  61. return files_stat.max_files;
  62. }
  63. EXPORT_SYMBOL_GPL(get_max_files);
  64. /*
  65. * Handle nr_files sysctl
  66. */
  67. #if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
  68. int proc_nr_files(struct ctl_table *table, int write,
  69. void __user *buffer, size_t *lenp, loff_t *ppos)
  70. {
  71. files_stat.nr_files = get_nr_files();
  72. return proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
  73. }
  74. #else
  75. int proc_nr_files(struct ctl_table *table, int write,
  76. void __user *buffer, size_t *lenp, loff_t *ppos)
  77. {
  78. return -ENOSYS;
  79. }
  80. #endif
  81. /* Find an unused file structure and return a pointer to it.
  82. * Returns an error pointer if some error happend e.g. we over file
  83. * structures limit, run out of memory or operation is not permitted.
  84. *
  85. * Be very careful using this. You are responsible for
  86. * getting write access to any mount that you might assign
  87. * to this filp, if it is opened for write. If this is not
  88. * done, you will imbalance int the mount's writer count
  89. * and a warning at __fput() time.
  90. */
  91. struct file *alloc_empty_file(int flags, const struct cred *cred)
  92. {
  93. static long old_max;
  94. struct file *f;
  95. int error;
  96. /*
  97. * Privileged users can go above max_files
  98. */
  99. if (get_nr_files() >= files_stat.max_files && !capable(CAP_SYS_ADMIN)) {
  100. /*
  101. * percpu_counters are inaccurate. Do an expensive check before
  102. * we go and fail.
  103. */
  104. if (percpu_counter_sum_positive(&nr_files) >= files_stat.max_files)
  105. goto over;
  106. }
  107. f = kmem_cache_zalloc(filp_cachep, GFP_KERNEL);
  108. if (unlikely(!f))
  109. return ERR_PTR(-ENOMEM);
  110. f->f_cred = get_cred(cred);
  111. error = security_file_alloc(f);
  112. if (unlikely(error)) {
  113. file_free_rcu(&f->f_u.fu_rcuhead);
  114. return ERR_PTR(error);
  115. }
  116. atomic_long_set(&f->f_count, 1);
  117. rwlock_init(&f->f_owner.lock);
  118. spin_lock_init(&f->f_lock);
  119. mutex_init(&f->f_pos_lock);
  120. eventpoll_init_file(f);
  121. f->f_flags = flags;
  122. f->f_mode = OPEN_FMODE(flags);
  123. /* f->f_version: 0 */
  124. percpu_counter_inc(&nr_files);
  125. return f;
  126. over:
  127. /* Ran out of filps - report that */
  128. if (get_nr_files() > old_max) {
  129. pr_info("VFS: file-max limit %lu reached\n", get_max_files());
  130. old_max = get_nr_files();
  131. }
  132. return ERR_PTR(-ENFILE);
  133. }
  134. /**
  135. * alloc_file - allocate and initialize a 'struct file'
  136. *
  137. * @path: the (dentry, vfsmount) pair for the new file
  138. * @flags: O_... flags with which the new file will be opened
  139. * @fop: the 'struct file_operations' for the new file
  140. */
  141. static struct file *alloc_file(const struct path *path, int flags,
  142. const struct file_operations *fop)
  143. {
  144. struct file *file;
  145. file = alloc_empty_file(flags, current_cred());
  146. if (IS_ERR(file))
  147. return file;
  148. file->f_path = *path;
  149. file->f_inode = path->dentry->d_inode;
  150. file->f_mapping = path->dentry->d_inode->i_mapping;
  151. file->f_wb_err = filemap_sample_wb_err(file->f_mapping);
  152. if ((file->f_mode & FMODE_READ) &&
  153. likely(fop->read || fop->read_iter))
  154. file->f_mode |= FMODE_CAN_READ;
  155. if ((file->f_mode & FMODE_WRITE) &&
  156. likely(fop->write || fop->write_iter))
  157. file->f_mode |= FMODE_CAN_WRITE;
  158. file->f_mode |= FMODE_OPENED;
  159. file->f_op = fop;
  160. if ((file->f_mode & (FMODE_READ | FMODE_WRITE)) == FMODE_READ)
  161. i_readcount_inc(path->dentry->d_inode);
  162. return file;
  163. }
  164. struct file *alloc_file_pseudo(struct inode *inode, struct vfsmount *mnt,
  165. const char *name, int flags,
  166. const struct file_operations *fops)
  167. {
  168. static const struct dentry_operations anon_ops = {
  169. .d_dname = simple_dname
  170. };
  171. struct qstr this = QSTR_INIT(name, strlen(name));
  172. struct path path;
  173. struct file *file;
  174. path.dentry = d_alloc_pseudo(mnt->mnt_sb, &this);
  175. if (!path.dentry)
  176. return ERR_PTR(-ENOMEM);
  177. if (!mnt->mnt_sb->s_d_op)
  178. d_set_d_op(path.dentry, &anon_ops);
  179. path.mnt = mntget(mnt);
  180. d_instantiate(path.dentry, inode);
  181. file = alloc_file(&path, flags, fops);
  182. if (IS_ERR(file)) {
  183. ihold(inode);
  184. path_put(&path);
  185. }
  186. return file;
  187. }
  188. EXPORT_SYMBOL(alloc_file_pseudo);
  189. struct file *alloc_file_clone(struct file *base, int flags,
  190. const struct file_operations *fops)
  191. {
  192. struct file *f = alloc_file(&base->f_path, flags, fops);
  193. if (!IS_ERR(f)) {
  194. path_get(&f->f_path);
  195. f->f_mapping = base->f_mapping;
  196. }
  197. return f;
  198. }
  199. /* the real guts of fput() - releasing the last reference to file
  200. */
  201. static void __fput(struct file *file)
  202. {
  203. struct dentry *dentry = file->f_path.dentry;
  204. struct vfsmount *mnt = file->f_path.mnt;
  205. struct inode *inode = file->f_inode;
  206. if (unlikely(!(file->f_mode & FMODE_OPENED)))
  207. goto out;
  208. might_sleep();
  209. fsnotify_close(file);
  210. /*
  211. * The function eventpoll_release() should be the first called
  212. * in the file cleanup chain.
  213. */
  214. eventpoll_release(file);
  215. locks_remove_file(file);
  216. ima_file_free(file);
  217. if (unlikely(file->f_flags & FASYNC)) {
  218. if (file->f_op->fasync)
  219. file->f_op->fasync(-1, file, 0);
  220. }
  221. if (file->f_op->release)
  222. file->f_op->release(inode, file);
  223. if (unlikely(S_ISCHR(inode->i_mode) && inode->i_cdev != NULL &&
  224. !(file->f_mode & FMODE_PATH))) {
  225. cdev_put(inode->i_cdev);
  226. }
  227. fops_put(file->f_op);
  228. put_pid(file->f_owner.pid);
  229. if ((file->f_mode & (FMODE_READ | FMODE_WRITE)) == FMODE_READ)
  230. i_readcount_dec(inode);
  231. if (file->f_mode & FMODE_WRITER) {
  232. put_write_access(inode);
  233. __mnt_drop_write(mnt);
  234. }
  235. dput(dentry);
  236. mntput(mnt);
  237. out:
  238. file_free(file);
  239. }
  240. static LLIST_HEAD(delayed_fput_list);
  241. static void delayed_fput(struct work_struct *unused)
  242. {
  243. struct llist_node *node = llist_del_all(&delayed_fput_list);
  244. struct file *f, *t;
  245. llist_for_each_entry_safe(f, t, node, f_u.fu_llist)
  246. __fput(f);
  247. }
  248. static void ____fput(struct callback_head *work)
  249. {
  250. __fput(container_of(work, struct file, f_u.fu_rcuhead));
  251. }
  252. /*
  253. * If kernel thread really needs to have the final fput() it has done
  254. * to complete, call this. The only user right now is the boot - we
  255. * *do* need to make sure our writes to binaries on initramfs has
  256. * not left us with opened struct file waiting for __fput() - execve()
  257. * won't work without that. Please, don't add more callers without
  258. * very good reasons; in particular, never call that with locks
  259. * held and never call that from a thread that might need to do
  260. * some work on any kind of umount.
  261. */
  262. void flush_delayed_fput(void)
  263. {
  264. delayed_fput(NULL);
  265. }
  266. static DECLARE_DELAYED_WORK(delayed_fput_work, delayed_fput);
  267. void fput(struct file *file)
  268. {
  269. if (atomic_long_dec_and_test(&file->f_count)) {
  270. struct task_struct *task = current;
  271. if (likely(!in_interrupt() && !(task->flags & PF_KTHREAD))) {
  272. init_task_work(&file->f_u.fu_rcuhead, ____fput);
  273. if (!task_work_add(task, &file->f_u.fu_rcuhead, true))
  274. return;
  275. /*
  276. * After this task has run exit_task_work(),
  277. * task_work_add() will fail. Fall through to delayed
  278. * fput to avoid leaking *file.
  279. */
  280. }
  281. if (llist_add(&file->f_u.fu_llist, &delayed_fput_list))
  282. schedule_delayed_work(&delayed_fput_work, 1);
  283. }
  284. }
  285. /*
  286. * synchronous analog of fput(); for kernel threads that might be needed
  287. * in some umount() (and thus can't use flush_delayed_fput() without
  288. * risking deadlocks), need to wait for completion of __fput() and know
  289. * for this specific struct file it won't involve anything that would
  290. * need them. Use only if you really need it - at the very least,
  291. * don't blindly convert fput() by kernel thread to that.
  292. */
  293. void __fput_sync(struct file *file)
  294. {
  295. if (atomic_long_dec_and_test(&file->f_count)) {
  296. struct task_struct *task = current;
  297. BUG_ON(!(task->flags & PF_KTHREAD));
  298. __fput(file);
  299. }
  300. }
  301. EXPORT_SYMBOL(fput);
  302. void __init files_init(void)
  303. {
  304. filp_cachep = kmem_cache_create("filp", sizeof(struct file), 0,
  305. SLAB_HWCACHE_ALIGN | SLAB_PANIC | SLAB_ACCOUNT, NULL);
  306. percpu_counter_init(&nr_files, 0, GFP_KERNEL);
  307. }
  308. /*
  309. * One file with associated inode and dcache is very roughly 1K. Per default
  310. * do not use more than 10% of our memory for files.
  311. */
  312. void __init files_maxfiles_init(void)
  313. {
  314. unsigned long n;
  315. unsigned long memreserve = (totalram_pages - nr_free_pages()) * 3/2;
  316. memreserve = min(memreserve, totalram_pages - 1);
  317. n = ((totalram_pages - memreserve) * (PAGE_SIZE / 1024)) / 10;
  318. files_stat.max_files = max_t(unsigned long, n, NR_FILE);
  319. }