file_table.c 10 KB

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