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