3
#include <linux/file.h>
4
#include <linux/fdtable.h>
5
#include <linux/fs_struct.h>
6
#include <linux/mount.h>
7
#include <linux/ptrace.h>
8
#include <linux/slab.h>
9
#include <linux/seq_file.h>
13
* Logic: we've got two memory sums for each process, "shared", and
14
* "non-shared". Shared memory may get counted more than once, for
15
* each process that owns it. Non-shared memory is counted
18
void task_mem(struct seq_file *m, struct mm_struct *mm)
20
struct vm_area_struct *vma;
21
struct vm_region *region;
23
unsigned long bytes = 0, sbytes = 0, slack = 0, size;
25
down_read(&mm->mmap_sem);
26
for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
27
vma = rb_entry(p, struct vm_area_struct, vm_rb);
29
bytes += kobjsize(vma);
31
region = vma->vm_region;
33
size = kobjsize(region);
34
size += region->vm_end - region->vm_start;
36
size = vma->vm_end - vma->vm_start;
39
if (atomic_read(&mm->mm_count) > 1 ||
40
vma->vm_flags & VM_MAYSHARE) {
45
slack = region->vm_end - vma->vm_end;
49
if (atomic_read(&mm->mm_count) > 1)
50
sbytes += kobjsize(mm);
52
bytes += kobjsize(mm);
54
if (current->fs && current->fs->users > 1)
55
sbytes += kobjsize(current->fs);
57
bytes += kobjsize(current->fs);
59
if (current->files && atomic_read(¤t->files->count) > 1)
60
sbytes += kobjsize(current->files);
62
bytes += kobjsize(current->files);
64
if (current->sighand && atomic_read(¤t->sighand->count) > 1)
65
sbytes += kobjsize(current->sighand);
67
bytes += kobjsize(current->sighand);
69
bytes += kobjsize(current); /* includes kernel stack */
73
"Slack:\t%8lu bytes\n"
74
"Shared:\t%8lu bytes\n",
75
bytes, slack, sbytes);
77
up_read(&mm->mmap_sem);
80
unsigned long task_vsize(struct mm_struct *mm)
82
struct vm_area_struct *vma;
84
unsigned long vsize = 0;
86
down_read(&mm->mmap_sem);
87
for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
88
vma = rb_entry(p, struct vm_area_struct, vm_rb);
89
vsize += vma->vm_end - vma->vm_start;
91
up_read(&mm->mmap_sem);
95
unsigned long task_statm(struct mm_struct *mm,
96
unsigned long *shared, unsigned long *text,
97
unsigned long *data, unsigned long *resident)
99
struct vm_area_struct *vma;
100
struct vm_region *region;
102
unsigned long size = kobjsize(mm);
104
down_read(&mm->mmap_sem);
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);
108
region = vma->vm_region;
110
size += kobjsize(region);
111
size += region->vm_end - region->vm_start;
115
*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
117
*data = (PAGE_ALIGN(mm->start_stack) - (mm->start_data & PAGE_MASK))
119
up_read(&mm->mmap_sem);
121
size += *text + *data;
126
static void pad_len_spaces(struct seq_file *m, int len)
128
len = 25 + sizeof(void*) * 6 - len;
131
seq_printf(m, "%*c", len, ' ');
135
* display a single VMA to a sequenced file
137
static int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma)
139
struct mm_struct *mm = vma->vm_mm;
140
unsigned long ino = 0;
144
unsigned long long pgoff = 0;
146
flags = vma->vm_flags;
150
struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
151
dev = inode->i_sb->s_dev;
153
pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
157
"%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
160
flags & VM_READ ? 'r' : '-',
161
flags & VM_WRITE ? 'w' : '-',
162
flags & VM_EXEC ? 'x' : '-',
163
flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
165
MAJOR(dev), MINOR(dev), ino, &len);
168
pad_len_spaces(m, len);
169
seq_path(m, &file->f_path, "");
171
if (vma->vm_start <= mm->start_stack &&
172
vma->vm_end >= mm->start_stack) {
173
pad_len_spaces(m, len);
174
seq_puts(m, "[stack]");
183
* display mapping lines for a particular process's /proc/pid/maps
185
static int show_map(struct seq_file *m, void *_p)
187
struct rb_node *p = _p;
189
return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb));
192
static void *m_start(struct seq_file *m, loff_t *pos)
194
struct proc_maps_private *priv = m->private;
195
struct mm_struct *mm;
199
/* pin the task and mm whilst we play with them */
200
priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
202
return ERR_PTR(-ESRCH);
204
mm = mm_for_maps(priv->task);
205
if (!mm || IS_ERR(mm)) {
206
put_task_struct(priv->task);
210
down_read(&mm->mmap_sem);
212
/* start from the Nth VMA */
213
for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
219
static void m_stop(struct seq_file *m, void *_vml)
221
struct proc_maps_private *priv = m->private;
224
struct mm_struct *mm = priv->task->mm;
225
up_read(&mm->mmap_sem);
227
put_task_struct(priv->task);
231
static void *m_next(struct seq_file *m, void *_p, loff_t *pos)
233
struct rb_node *p = _p;
236
return p ? rb_next(p) : NULL;
239
static const struct seq_operations proc_pid_maps_ops = {
246
static int maps_open(struct inode *inode, struct file *file)
248
struct proc_maps_private *priv;
251
priv = kzalloc(sizeof(*priv), GFP_KERNEL);
253
priv->pid = proc_pid(inode);
254
ret = seq_open(file, &proc_pid_maps_ops);
256
struct seq_file *m = file->private_data;
265
const struct file_operations proc_maps_operations = {
269
.release = seq_release_private,