file_table.c 8.6 KB

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