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