]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/proc/task_nommu.c
ext4: avoid possible double brelse() in add_new_gdb() on error path
[mirror_ubuntu-bionic-kernel.git] / fs / proc / task_nommu.c
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 */
21 void 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 down_read(&mm->mmap_sem);
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(&current->files->count) > 1)
63 sbytes += kobjsize(current->files);
64 else
65 bytes += kobjsize(current->files);
66
67 if (current->sighand && atomic_read(&current->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 up_read(&mm->mmap_sem);
81 }
82
83 unsigned 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 down_read(&mm->mmap_sem);
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 up_read(&mm->mmap_sem);
95 return vsize;
96 }
97
98 unsigned 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 down_read(&mm->mmap_sem);
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 up_read(&mm->mmap_sem);
123 size >>= PAGE_SHIFT;
124 size += *text + *data;
125 *resident = size;
126 return size;
127 }
128
129 static 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 */
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 unsigned long ino = 0;
150 struct file *file;
151 dev_t dev = 0;
152 int flags;
153 unsigned long long pgoff = 0;
154
155 flags = vma->vm_flags;
156 file = vma->vm_file;
157
158 if (file) {
159 struct inode *inode;
160
161 file = vma_pr_or_file(vma);
162 inode = file_inode(file);
163 dev = inode->i_sb->s_dev;
164 ino = inode->i_ino;
165 pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
166 }
167
168 seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
169 seq_printf(m,
170 "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
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',
177 pgoff,
178 MAJOR(dev), MINOR(dev), ino);
179
180 if (file) {
181 seq_pad(m, ' ');
182 seq_file_path(m, file, "");
183 } else if (mm && is_stack(vma)) {
184 seq_pad(m, ' ');
185 seq_printf(m, "[stack]");
186 }
187
188 seq_putc(m, '\n');
189 return 0;
190 }
191
192 /*
193 * display mapping lines for a particular process's /proc/pid/maps
194 */
195 static int show_map(struct seq_file *m, void *_p, int is_pid)
196 {
197 struct rb_node *p = _p;
198
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);
211 }
212
213 static void *m_start(struct seq_file *m, loff_t *pos)
214 {
215 struct proc_maps_private *priv = m->private;
216 struct mm_struct *mm;
217 struct rb_node *p;
218 loff_t n = *pos;
219
220 /* pin the task and mm whilst we play with them */
221 priv->task = get_proc_task(priv->inode);
222 if (!priv->task)
223 return ERR_PTR(-ESRCH);
224
225 mm = priv->mm;
226 if (!mm || !mmget_not_zero(mm))
227 return NULL;
228
229 down_read(&mm->mmap_sem);
230 /* start from the Nth VMA */
231 for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
232 if (n-- == 0)
233 return p;
234
235 up_read(&mm->mmap_sem);
236 mmput(mm);
237 return NULL;
238 }
239
240 static void m_stop(struct seq_file *m, void *_vml)
241 {
242 struct proc_maps_private *priv = m->private;
243
244 if (!IS_ERR_OR_NULL(_vml)) {
245 up_read(&priv->mm->mmap_sem);
246 mmput(priv->mm);
247 }
248 if (priv->task) {
249 put_task_struct(priv->task);
250 priv->task = NULL;
251 }
252 }
253
254 static void *m_next(struct seq_file *m, void *_p, loff_t *pos)
255 {
256 struct rb_node *p = _p;
257
258 (*pos)++;
259 return p ? rb_next(p) : NULL;
260 }
261
262 static const struct seq_operations proc_pid_maps_ops = {
263 .start = m_start,
264 .next = m_next,
265 .stop = m_stop,
266 .show = show_pid_map
267 };
268
269 static const struct seq_operations proc_tid_maps_ops = {
270 .start = m_start,
271 .next = m_next,
272 .stop = m_stop,
273 .show = show_tid_map
274 };
275
276 static int maps_open(struct inode *inode, struct file *file,
277 const struct seq_operations *ops)
278 {
279 struct proc_maps_private *priv;
280
281 priv = __seq_open_private(file, ops, sizeof(*priv));
282 if (!priv)
283 return -ENOMEM;
284
285 priv->inode = inode;
286 priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
287 if (IS_ERR(priv->mm)) {
288 int err = PTR_ERR(priv->mm);
289
290 seq_release_private(inode, file);
291 return err;
292 }
293
294 return 0;
295 }
296
297
298 static int map_release(struct inode *inode, struct file *file)
299 {
300 struct seq_file *seq = file->private_data;
301 struct proc_maps_private *priv = seq->private;
302
303 if (priv->mm)
304 mmdrop(priv->mm);
305
306 return seq_release_private(inode, file);
307 }
308
309 static int pid_maps_open(struct inode *inode, struct file *file)
310 {
311 return maps_open(inode, file, &proc_pid_maps_ops);
312 }
313
314 static int tid_maps_open(struct inode *inode, struct file *file)
315 {
316 return maps_open(inode, file, &proc_tid_maps_ops);
317 }
318
319 const struct file_operations proc_pid_maps_operations = {
320 .open = pid_maps_open,
321 .read = seq_read,
322 .llseek = seq_lseek,
323 .release = map_release,
324 };
325
326 const struct file_operations proc_tid_maps_operations = {
327 .open = tid_maps_open,
328 .read = seq_read,
329 .llseek = seq_lseek,
330 .release = map_release,
331 };
332