fs/file_table.c

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