fs/proc/task_nommu.c

   1
   2 #include <linux/mm.h>
   3 #include <linux/file.h>
   4 #include <linux/fdtable.h>
   5 #include <linux/fs_struct.h>
   6 #include <linux/mount.h>
   7 #include <linux/ptrace.h>
   8 #include <linux/slab.h>
   9 #include <linux/seq_file.h>
  10 #include <linux/sched/mm.h>
  11
  12 #include "internal.h"
  13
  14 /*
  15  * Logic: we've got two memory sums for each process, "shared", and
  16  * "non-shared". Shared memory may get counted more than once, for
  17  * each process that owns it. Non-shared memory is counted
  18  * accurately.
  19  */
  20 void task_mem(struct seq_file *m, struct mm_struct *mm)
  21 {
  22         struct vm_area_struct *vma;
  23         struct vm_region *region;
  24         struct rb_node *p;
  25         unsigned long bytes = 0, sbytes = 0, slack = 0, size;
  26
  27         down_read(&mm->mmap_sem);
  28         for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
  29                 vma = rb_entry(p, struct vm_area_struct, vm_rb);
  30
  31                 bytes += kobjsize(vma);
  32
  33                 region = vma->vm_region;
  34                 if (region) {
  35                         size = kobjsize(region);
  36                         size += region->vm_end - region->vm_start;
  37                 } else {
  38                         size = vma->vm_end - vma->vm_start;
  39                 }
  40
  41                 if (atomic_read(&mm->mm_count) > 1 ||
  42                     vma->vm_flags & VM_MAYSHARE) {
  43                         sbytes += size;
  44                 } else {
  45                         bytes += size;
  46                         if (region)
  47                                 slack = region->vm_end - vma->vm_end;
  48                 }
  49         }
  50
  51         if (atomic_read(&mm->mm_count) > 1)
  52                 sbytes += kobjsize(mm);
  53         else
  54                 bytes += kobjsize(mm);
  55
  56         if (current->fs && current->fs->users > 1)
  57                 sbytes += kobjsize(current->fs);
  58         else
  59                 bytes += kobjsize(current->fs);
  60
  61         if (current->files && atomic_read(&current->files->count) > 1)
  62                 sbytes += kobjsize(current->files);
  63         else
  64                 bytes += kobjsize(current->files);
  65
  66         if (current->sighand && atomic_read(&current->sighand->count) > 1)
  67                 sbytes += kobjsize(current->sighand);
  68         else
  69                 bytes += kobjsize(current->sighand);
  70
  71         bytes += kobjsize(current); /* includes kernel stack */
  72
  73         seq_printf(m,
  74                 "Mem:\t%8lu bytes\n"
  75                 "Slack:\t%8lu bytes\n"
  76                 "Shared:\t%8lu bytes\n",
  77                 bytes, slack, sbytes);
  78
  79         up_read(&mm->mmap_sem);
  80 }
  81
  82 unsigned long task_vsize(struct mm_struct *mm)
  83 {
  84         struct vm_area_struct *vma;
  85         struct rb_node *p;
  86         unsigned long vsize = 0;
  87
  88         down_read(&mm->mmap_sem);
  89         for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
  90                 vma = rb_entry(p, struct vm_area_struct, vm_rb);
  91                 vsize += vma->vm_end - vma->vm_start;
  92         }
  93         up_read(&mm->mmap_sem);
  94         return vsize;
  95 }
  96
  97 unsigned long task_statm(struct mm_struct *mm,
  98                          unsigned long *shared, unsigned long *text,
  99                          unsigned long *data, unsigned long *resident)
 100 {
 101         struct vm_area_struct *vma;
 102         struct vm_region *region;
 103         struct rb_node *p;
 104         unsigned long size = kobjsize(mm);
 105
 106         down_read(&mm->mmap_sem);
 107         for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
 108                 vma = rb_entry(p, struct vm_area_struct, vm_rb);
 109                 size += kobjsize(vma);
 110                 region = vma->vm_region;
 111                 if (region) {
 112                         size += kobjsize(region);
 113                         size += region->vm_end - region->vm_start;
 114                 }
 115         }
 116
 117         *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
 118                 >> PAGE_SHIFT;
 119         *data = (PAGE_ALIGN(mm->start_stack) - (mm->start_data & PAGE_MASK))
 120                 >> PAGE_SHIFT;
 121         up_read(&mm->mmap_sem);
 122         size >>= PAGE_SHIFT;
 123         size += *text + *data;
 124         *resident = size;
 125         return size;
 126 }
 127
 128 static int is_stack(struct proc_maps_private *priv,
 129                     struct vm_area_struct *vma)
 130 {
 131         struct mm_struct *mm = vma->vm_mm;
 132
 133         /*
 134          * We make no effort to guess what a given thread considers to be
 135          * its "stack".  It's not even well-defined for programs written
 136          * languages like Go.
 137          */
 138         return vma->vm_start <= mm->start_stack &&
 139                 vma->vm_end >= mm->start_stack;
 140 }
 141
 142 /*
 143  * display a single VMA to a sequenced file
 144  */
 145 static int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma,
 146                           int is_pid)
 147 {
 148         struct mm_struct *mm = vma->vm_mm;
 149         struct proc_maps_private *priv = m->private;
 150         unsigned long ino = 0;
 151         struct file *file;
 152         dev_t dev = 0;
 153         int flags;
 154         unsigned long long pgoff = 0;
 155
 156         flags = vma->vm_flags;
 157         file = vma->vm_file;
 158
 159         if (file) {
 160                 struct inode *inode;
 161
 162                 file = vma_pr_or_file(vma);
 163                 inode = file_inode(file);
 164                 dev = inode->i_sb->s_dev;
 165                 ino = inode->i_ino;
 166                 pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
 167         }
 168
 169         seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
 170         seq_printf(m,
 171                    "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
 172                    vma->vm_start,
 173                    vma->vm_end,
 174                    flags & VM_READ ? 'r' : '-',
 175                    flags & VM_WRITE ? 'w' : '-',
 176                    flags & VM_EXEC ? 'x' : '-',
 177                    flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
 178                    pgoff,
 179                    MAJOR(dev), MINOR(dev), ino);
 180
 181         if (file) {
 182                 seq_pad(m, ' ');
 183                 seq_file_path(m, file, "");
 184         } else if (mm && is_stack(priv, vma)) {
 185                 seq_pad(m, ' ');
 186                 seq_printf(m, "[stack]");
 187         }
 188
 189         seq_putc(m, '\n');
 190         return 0;
 191 }
 192
 193 /*
 194  * display mapping lines for a particular process's /proc/pid/maps
 195  */
 196 static int show_map(struct seq_file *m, void *_p, int is_pid)
 197 {
 198         struct rb_node *p = _p;
 199
 200         return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb),
 201                               is_pid);
 202 }
 203
 204 static int show_pid_map(struct seq_file *m, void *_p)
 205 {
 206         return show_map(m, _p, 1);
 207 }
 208
 209 static int show_tid_map(struct seq_file *m, void *_p)
 210 {
 211         return show_map(m, _p, 0);
 212 }
 213
 214 static void *m_start(struct seq_file *m, loff_t *pos)
 215 {
 216         struct proc_maps_private *priv = m->private;
 217         struct mm_struct *mm;
 218         struct rb_node *p;
 219         loff_t n = *pos;
 220
 221         /* pin the task and mm whilst we play with them */
 222         priv->task = get_proc_task(priv->inode);
 223         if (!priv->task)
 224                 return ERR_PTR(-ESRCH);
 225
 226         mm = priv->mm;
 227         if (!mm || !mmget_not_zero(mm))
 228                 return NULL;
 229
 230         down_read(&mm->mmap_sem);
 231         /* start from the Nth VMA */
 232         for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
 233                 if (n-- == 0)
 234                         return p;
 235
 236         up_read(&mm->mmap_sem);
 237         mmput(mm);
 238         return NULL;
 239 }
 240
 241 static void m_stop(struct seq_file *m, void *_vml)
 242 {
 243         struct proc_maps_private *priv = m->private;
 244
 245         if (!IS_ERR_OR_NULL(_vml)) {
 246                 up_read(&priv->mm->mmap_sem);
 247                 mmput(priv->mm);
 248         }
 249         if (priv->task) {
 250                 put_task_struct(priv->task);
 251                 priv->task = NULL;
 252         }
 253 }
 254
 255 static void *m_next(struct seq_file *m, void *_p, loff_t *pos)
 256 {
 257         struct rb_node *p = _p;
 258
 259         (*pos)++;
 260         return p ? rb_next(p) : NULL;
 261 }
 262
 263 static const struct seq_operations proc_pid_maps_ops = {
 264         .start  = m_start,
 265         .next   = m_next,
 266         .stop   = m_stop,
 267         .show   = show_pid_map
 268 };
 269
 270 static const struct seq_operations proc_tid_maps_ops = {
 271         .start  = m_start,
 272         .next   = m_next,
 273         .stop   = m_stop,
 274         .show   = show_tid_map
 275 };
 276
 277 static int maps_open(struct inode *inode, struct file *file,
 278                      const struct seq_operations *ops)
 279 {
 280         struct proc_maps_private *priv;
 281
 282         priv = __seq_open_private(file, ops, sizeof(*priv));
 283         if (!priv)
 284                 return -ENOMEM;
 285
 286         priv->inode = inode;
 287         priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
 288         if (IS_ERR(priv->mm)) {
 289                 int err = PTR_ERR(priv->mm);
 290
 291                 seq_release_private(inode, file);
 292                 return err;
 293         }
 294
 295         return 0;
 296 }
 297
 298
 299 static int map_release(struct inode *inode, struct file *file)
 300 {
 301         struct seq_file *seq = file->private_data;
 302         struct proc_maps_private *priv = seq->private;
 303
 304         if (priv->mm)
 305                 mmdrop(priv->mm);
 306
 307         return seq_release_private(inode, file);
 308 }
 309
 310 static int pid_maps_open(struct inode *inode, struct file *file)
 311 {
 312         return maps_open(inode, file, &proc_pid_maps_ops);
 313 }
 314
 315 static int tid_maps_open(struct inode *inode, struct file *file)
 316 {
 317         return maps_open(inode, file, &proc_tid_maps_ops);
 318 }
 319
 320 const struct file_operations proc_pid_maps_operations = {
 321         .open           = pid_maps_open,
 322         .read           = seq_read,
 323         .llseek         = seq_lseek,
 324         .release        = map_release,
 325 };
 326
 327 const struct file_operations proc_tid_maps_operations = {
 328         .open           = tid_maps_open,
 329         .read           = seq_read,
 330         .llseek         = seq_lseek,
 331         .release        = map_release,
 332 };
 333