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