file_table.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304
  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/config.h>
  8. #include <linux/string.h>
  9. #include <linux/slab.h>
  10. #include <linux/file.h>
  11. #include <linux/init.h>
  12. #include <linux/module.h>
  13. #include <linux/smp_lock.h>
  14. #include <linux/fs.h>
  15. #include <linux/security.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. static struct percpu_counter nr_files __cacheline_aligned_in_smp;
  32. static inline void file_free_rcu(struct rcu_head *head)
  33. {
  34. struct file *f = container_of(head, struct file, f_u.fu_rcuhead);
  35. kmem_cache_free(filp_cachep, f);
  36. }
  37. static inline void file_free(struct file *f)
  38. {
  39. percpu_counter_dec(&nr_files);
  40. call_rcu(&f->f_u.fu_rcuhead, file_free_rcu);
  41. }
  42. /*
  43. * Return the total number of open files in the system
  44. */
  45. static int get_nr_files(void)
  46. {
  47. return percpu_counter_read_positive(&nr_files);
  48. }
  49. /*
  50. * Return the maximum number of open files in the system
  51. */
  52. int get_max_files(void)
  53. {
  54. return files_stat.max_files;
  55. }
  56. EXPORT_SYMBOL_GPL(get_max_files);
  57. /*
  58. * Handle nr_files sysctl
  59. */
  60. #if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS)
  61. int proc_nr_files(ctl_table *table, int write, struct file *filp,
  62. void __user *buffer, size_t *lenp, loff_t *ppos)
  63. {
  64. files_stat.nr_files = get_nr_files();
  65. return proc_dointvec(table, write, filp, buffer, lenp, ppos);
  66. }
  67. #else
  68. int proc_nr_files(ctl_table *table, int write, struct file *filp,
  69. void __user *buffer, size_t *lenp, loff_t *ppos)
  70. {
  71. return -ENOSYS;
  72. }
  73. #endif
  74. /* Find an unused file structure and return a pointer to it.
  75. * Returns NULL, if there are no more free file structures or
  76. * we run out of memory.
  77. */
  78. struct file *get_empty_filp(void)
  79. {
  80. struct task_struct *tsk;
  81. static int old_max;
  82. struct file * f;
  83. /*
  84. * Privileged users can go above max_files
  85. */
  86. if (get_nr_files() >= files_stat.max_files && !capable(CAP_SYS_ADMIN)) {
  87. /*
  88. * percpu_counters are inaccurate. Do an expensive check before
  89. * we go and fail.
  90. */
  91. if (percpu_counter_sum(&nr_files) >= files_stat.max_files)
  92. goto over;
  93. }
  94. f = kmem_cache_alloc(filp_cachep, GFP_KERNEL);
  95. if (f == NULL)
  96. goto fail;
  97. percpu_counter_inc(&nr_files);
  98. memset(f, 0, sizeof(*f));
  99. if (security_file_alloc(f))
  100. goto fail_sec;
  101. tsk = current;
  102. INIT_LIST_HEAD(&f->f_u.fu_list);
  103. atomic_set(&f->f_count, 1);
  104. rwlock_init(&f->f_owner.lock);
  105. f->f_uid = tsk->fsuid;
  106. f->f_gid = tsk->fsgid;
  107. eventpoll_init_file(f);
  108. /* f->f_version: 0 */
  109. return f;
  110. over:
  111. /* Ran out of filps - report that */
  112. if (get_nr_files() > old_max) {
  113. printk(KERN_INFO "VFS: file-max limit %d reached\n",
  114. get_max_files());
  115. old_max = get_nr_files();
  116. }
  117. goto fail;
  118. fail_sec:
  119. file_free(f);
  120. fail:
  121. return NULL;
  122. }
  123. EXPORT_SYMBOL(get_empty_filp);
  124. void fastcall fput(struct file *file)
  125. {
  126. if (atomic_dec_and_test(&file->f_count))
  127. __fput(file);
  128. }
  129. EXPORT_SYMBOL(fput);
  130. /* __fput is called from task context when aio completion releases the last
  131. * last use of a struct file *. Do not use otherwise.
  132. */
  133. void fastcall __fput(struct file *file)
  134. {
  135. struct dentry *dentry = file->f_dentry;
  136. struct vfsmount *mnt = file->f_vfsmnt;
  137. struct inode *inode = dentry->d_inode;
  138. might_sleep();
  139. fsnotify_close(file);
  140. /*
  141. * The function eventpoll_release() should be the first called
  142. * in the file cleanup chain.
  143. */
  144. eventpoll_release(file);
  145. locks_remove_flock(file);
  146. if (file->f_op && file->f_op->release)
  147. file->f_op->release(inode, file);
  148. security_file_free(file);
  149. if (unlikely(inode->i_cdev != NULL))
  150. cdev_put(inode->i_cdev);
  151. fops_put(file->f_op);
  152. if (file->f_mode & FMODE_WRITE)
  153. put_write_access(inode);
  154. file_kill(file);
  155. file->f_dentry = NULL;
  156. file->f_vfsmnt = NULL;
  157. file_free(file);
  158. dput(dentry);
  159. mntput(mnt);
  160. }
  161. struct file fastcall *fget(unsigned int fd)
  162. {
  163. struct file *file;
  164. struct files_struct *files = current->files;
  165. rcu_read_lock();
  166. file = fcheck_files(files, fd);
  167. if (file) {
  168. if (!atomic_inc_not_zero(&file->f_count)) {
  169. /* File object ref couldn't be taken */
  170. rcu_read_unlock();
  171. return NULL;
  172. }
  173. }
  174. rcu_read_unlock();
  175. return file;
  176. }
  177. EXPORT_SYMBOL(fget);
  178. /*
  179. * Lightweight file lookup - no refcnt increment if fd table isn't shared.
  180. * You can use this only if it is guranteed that the current task already
  181. * holds a refcnt to that file. That check has to be done at fget() only
  182. * and a flag is returned to be passed to the corresponding fput_light().
  183. * There must not be a cloning between an fget_light/fput_light pair.
  184. */
  185. struct file fastcall *fget_light(unsigned int fd, int *fput_needed)
  186. {
  187. struct file *file;
  188. struct files_struct *files = current->files;
  189. *fput_needed = 0;
  190. if (likely((atomic_read(&files->count) == 1))) {
  191. file = fcheck_files(files, fd);
  192. } else {
  193. rcu_read_lock();
  194. file = fcheck_files(files, fd);
  195. if (file) {
  196. if (atomic_inc_not_zero(&file->f_count))
  197. *fput_needed = 1;
  198. else
  199. /* Didn't get the reference, someone's freed */
  200. file = NULL;
  201. }
  202. rcu_read_unlock();
  203. }
  204. return file;
  205. }
  206. void put_filp(struct file *file)
  207. {
  208. if (atomic_dec_and_test(&file->f_count)) {
  209. security_file_free(file);
  210. file_kill(file);
  211. file_free(file);
  212. }
  213. }
  214. void file_move(struct file *file, struct list_head *list)
  215. {
  216. if (!list)
  217. return;
  218. file_list_lock();
  219. list_move(&file->f_u.fu_list, list);
  220. file_list_unlock();
  221. }
  222. void file_kill(struct file *file)
  223. {
  224. if (!list_empty(&file->f_u.fu_list)) {
  225. file_list_lock();
  226. list_del_init(&file->f_u.fu_list);
  227. file_list_unlock();
  228. }
  229. }
  230. int fs_may_remount_ro(struct super_block *sb)
  231. {
  232. struct list_head *p;
  233. /* Check that no files are currently opened for writing. */
  234. file_list_lock();
  235. list_for_each(p, &sb->s_files) {
  236. struct file *file = list_entry(p, struct file, f_u.fu_list);
  237. struct inode *inode = file->f_dentry->d_inode;
  238. /* File with pending delete? */
  239. if (inode->i_nlink == 0)
  240. goto too_bad;
  241. /* Writeable file? */
  242. if (S_ISREG(inode->i_mode) && (file->f_mode & FMODE_WRITE))
  243. goto too_bad;
  244. }
  245. file_list_unlock();
  246. return 1; /* Tis' cool bro. */
  247. too_bad:
  248. file_list_unlock();
  249. return 0;
  250. }
  251. void __init files_init(unsigned long mempages)
  252. {
  253. int n;
  254. /* One file with associated inode and dcache is very roughly 1K.
  255. * Per default don't use more than 10% of our memory for files.
  256. */
  257. n = (mempages * (PAGE_SIZE / 1024)) / 10;
  258. files_stat.max_files = n;
  259. if (files_stat.max_files < NR_FILE)
  260. files_stat.max_files = NR_FILE;
  261. files_defer_init();
  262. percpu_counter_init(&nr_files);
  263. }