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