file_table.c 10 KB

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