[mirror_ubuntu-artful-kernel.git] / fs / proc / task_nommu.c


#include <linux/mm.h>
#include <linux/file.h>
#include <linux/fdtable.h>
#include <linux/fs_struct.h>
#include <linux/mount.h>
#include <linux/ptrace.h>
#include <linux/slab.h>
#include <linux/seq_file.h>
#include <linux/sched/mm.h>

#include "internal.h"

/*
 * Logic: we've got two memory sums for each process, "shared", and
 * "non-shared". Shared memory may get counted more than once, for
 * each process that owns it. Non-shared memory is counted
 * accurately.
 */
void task_mem(struct seq_file *m, struct mm_struct *mm)
{
	struct vm_area_struct *vma;
	struct vm_region *region;
	struct rb_node *p;
	unsigned long bytes = 0, sbytes = 0, slack = 0, size;
        
	down_read(&mm->mmap_sem);
	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
		vma = rb_entry(p, struct vm_area_struct, vm_rb);

		bytes += kobjsize(vma);

		region = vma->vm_region;
		if (region) {
			size = kobjsize(region);
			size += region->vm_end - region->vm_start;
		} else {
			size = vma->vm_end - vma->vm_start;
		}

		if (atomic_read(&mm->mm_count) > 1 ||
		    vma->vm_flags & VM_MAYSHARE) {
			sbytes += size;
		} else {
			bytes += size;
			if (region)
				slack = region->vm_end - vma->vm_end;
		}
	}

	if (atomic_read(&mm->mm_count) > 1)
		sbytes += kobjsize(mm);
	else
		bytes += kobjsize(mm);
	
	if (current->fs && current->fs->users > 1)
		sbytes += kobjsize(current->fs);
	else
		bytes += kobjsize(current->fs);

	if (current->files && atomic_read(&current->files->count) > 1)
		sbytes += kobjsize(current->files);
	else
		bytes += kobjsize(current->files);

	if (current->sighand && atomic_read(&current->sighand->count) > 1)
		sbytes += kobjsize(current->sighand);
	else
		bytes += kobjsize(current->sighand);

	bytes += kobjsize(current); /* includes kernel stack */

	seq_printf(m,
		"Mem:\t%8lu bytes\n"
		"Slack:\t%8lu bytes\n"
		"Shared:\t%8lu bytes\n",
		bytes, slack, sbytes);

	up_read(&mm->mmap_sem);
}

unsigned long task_vsize(struct mm_struct *mm)
{
	struct vm_area_struct *vma;
	struct rb_node *p;
	unsigned long vsize = 0;

	down_read(&mm->mmap_sem);
	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
		vma = rb_entry(p, struct vm_area_struct, vm_rb);
		vsize += vma->vm_end - vma->vm_start;
	}
	up_read(&mm->mmap_sem);
	return vsize;
}

unsigned long task_statm(struct mm_struct *mm,
			 unsigned long *shared, unsigned long *text,
			 unsigned long *data, unsigned long *resident)
{
	struct vm_area_struct *vma;
	struct vm_region *region;
	struct rb_node *p;
	unsigned long size = kobjsize(mm);

	down_read(&mm->mmap_sem);
	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
		vma = rb_entry(p, struct vm_area_struct, vm_rb);
		size += kobjsize(vma);
		region = vma->vm_region;
		if (region) {
			size += kobjsize(region);
			size += region->vm_end - region->vm_start;
		}
	}

	*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
		>> PAGE_SHIFT;
	*data = (PAGE_ALIGN(mm->start_stack) - (mm->start_data & PAGE_MASK))
		>> PAGE_SHIFT;
	up_read(&mm->mmap_sem);
	size >>= PAGE_SHIFT;
	size += *text + *data;
	*resident = size;
	return size;
}

static int is_stack(struct proc_maps_private *priv,
		    struct vm_area_struct *vma)
{
	struct mm_struct *mm = vma->vm_mm;

	/*
	 * We make no effort to guess what a given thread considers to be
	 * its "stack".  It's not even well-defined for programs written
	 * languages like Go.
	 */
	return vma->vm_start <= mm->start_stack &&
		vma->vm_end >= mm->start_stack;
}

/*
 * display a single VMA to a sequenced file
 */
static int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma,
			  int is_pid)
{
	struct mm_struct *mm = vma->vm_mm;
	struct proc_maps_private *priv = m->private;
	unsigned long ino = 0;
	struct file *file;
	dev_t dev = 0;
	int flags;
	unsigned long long pgoff = 0;

	flags = vma->vm_flags;
	file = vma->vm_file;

	if (file) {
		struct inode *inode;

		file = vma_pr_or_file(vma);
		inode = file_inode(file);
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
		pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
	}

	seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
	seq_printf(m,
		   "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
		   vma->vm_start,
		   vma->vm_end,
		   flags & VM_READ ? 'r' : '-',
		   flags & VM_WRITE ? 'w' : '-',
		   flags & VM_EXEC ? 'x' : '-',
		   flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
		   pgoff,
		   MAJOR(dev), MINOR(dev), ino);

	if (file) {
		seq_pad(m, ' ');
		seq_file_path(m, file, "");
	} else if (mm && is_stack(priv, vma)) {
		seq_pad(m, ' ');
		seq_printf(m, "[stack]");
	}

	seq_putc(m, '\n');
	return 0;
}

/*
 * display mapping lines for a particular process's /proc/pid/maps
 */
static int show_map(struct seq_file *m, void *_p, int is_pid)
{
	struct rb_node *p = _p;

	return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb),
			      is_pid);
}

static int show_pid_map(struct seq_file *m, void *_p)
{
	return show_map(m, _p, 1);
}

static int show_tid_map(struct seq_file *m, void *_p)
{
	return show_map(m, _p, 0);
}

static void *m_start(struct seq_file *m, loff_t *pos)
{
	struct proc_maps_private *priv = m->private;
	struct mm_struct *mm;
	struct rb_node *p;
	loff_t n = *pos;

	/* pin the task and mm whilst we play with them */
	priv->task = get_proc_task(priv->inode);
	if (!priv->task)
		return ERR_PTR(-ESRCH);

	mm = priv->mm;
	if (!mm || !mmget_not_zero(mm))
		return NULL;

	down_read(&mm->mmap_sem);
	/* start from the Nth VMA */
	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
		if (n-- == 0)
			return p;

	up_read(&mm->mmap_sem);
	mmput(mm);
	return NULL;
}

static void m_stop(struct seq_file *m, void *_vml)
{
	struct proc_maps_private *priv = m->private;

	if (!IS_ERR_OR_NULL(_vml)) {
		up_read(&priv->mm->mmap_sem);
		mmput(priv->mm);
	}
	if (priv->task) {
		put_task_struct(priv->task);
		priv->task = NULL;
	}
}

static void *m_next(struct seq_file *m, void *_p, loff_t *pos)
{
	struct rb_node *p = _p;

	(*pos)++;
	return p ? rb_next(p) : NULL;
}

static const struct seq_operations proc_pid_maps_ops = {
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_pid_map
};

static const struct seq_operations proc_tid_maps_ops = {
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_tid_map
};

static int maps_open(struct inode *inode, struct file *file,
		     const struct seq_operations *ops)
{
	struct proc_maps_private *priv;

	priv = __seq_open_private(file, ops, sizeof(*priv));
	if (!priv)
		return -ENOMEM;

	priv->inode = inode;
	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
	if (IS_ERR(priv->mm)) {
		int err = PTR_ERR(priv->mm);

		seq_release_private(inode, file);
		return err;
	}

	return 0;
}


static int map_release(struct inode *inode, struct file *file)
{
	struct seq_file *seq = file->private_data;
	struct proc_maps_private *priv = seq->private;

	if (priv->mm)
		mmdrop(priv->mm);

	return seq_release_private(inode, file);
}

static int pid_maps_open(struct inode *inode, struct file *file)
{
	return maps_open(inode, file, &proc_pid_maps_ops);
}

static int tid_maps_open(struct inode *inode, struct file *file)
{
	return maps_open(inode, file, &proc_tid_maps_ops);
}

const struct file_operations proc_pid_maps_operations = {
	.open		= pid_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= map_release,
};

const struct file_operations proc_tid_maps_operations = {
	.open		= tid_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= map_release,
};
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>
6e84f315 IM	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
1da177e4 LT	27	down_read(&mm->mmap_sem);
8feae131 DH	28	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
8feae131 DH	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(&current->files->count) > 1)
	62	sbytes += kobjsize(current->files);
	63	else
	64	bytes += kobjsize(current->files);
	65
	66	if (current->sighand && atomic_read(&current->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;
8feae131 DH	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)) {
8feae131 DH	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
1da177e4 LT	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	}
1da177e4 LT	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;
7e1e0ef2 SM	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	}
58cb6548 ON	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,
b7643757 SP	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) {
b6450630 SF	160	struct inode *inode;
	161
	162	file = vma_pr_or_file(vma);
	163	inode = file_inode(file);
8feae131 DH	164	dev = inode->i_sb->s_dev;
8feae131 DH	165	ino = inode->i_ino;
4c967291	166	pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
8feae131 DH	167	}
8feae131 DH	168
652586df	169	seq_setwidth(m, 25 + sizeof(void ) 6 - 1);
8feae131	170	seq_printf(m,
652586df	171	"%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
8feae131 DH	172	vma->vm_start,
	173	vma->vm_end,
	174	flags & VM_READ ? 'r' : '-',
	175	flags & VM_WRITE ? 'w' : '-',
	176	flags & VM_EXEC ? 'x' : '-',
	177	flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
6260a4b0	178	pgoff,
652586df	179	MAJOR(dev), MINOR(dev), ino);
8feae131 DH	180
8feae131 DH	181	if (file) {
652586df	182	seq_pad(m, ' ');
2726d566	183	seq_file_path(m, file, "");
b18cb64e	184	} else if (mm && is_stack(priv, vma)) {
65376df5 JW	185	seq_pad(m, ' ');
65376df5 JW	186	seq_printf(m, "[stack]");
8feae131 DH	187	}
	188
	189	seq_putc(m, '\n');
	190	return 0;
	191	}
	192
1da177e4	193	/*
dbf8685c	194	* display mapping lines for a particular process's /proc/pid/maps
1da177e4	195	*/
b7643757	196	static int show_map(struct seq_file m, void _p, int is_pid)
1da177e4	197	{
8feae131	198	struct rb_node *p = _p;
5096add8	199
b7643757 SP	200	return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb),
	201	is_pid);
	202	}
	203
	204	static int show_pid_map(struct seq_file m, void _p)
	205	{
	206	return show_map(m, _p, 1);
	207	}
	208
	209	static int show_tid_map(struct seq_file m, void _p)
	210	{
	211	return show_map(m, _p, 0);
1da177e4	212	}
dbf8685c	213
1da177e4 LT	214	static void m_start(struct seq_file m, loff_t *pos)
1da177e4 LT	215	{
dbf8685c	216	struct proc_maps_private *priv = m->private;
dbf8685c	217	struct mm_struct *mm;
8feae131	218	struct rb_node *p;
dbf8685c DH	219	loff_t n = *pos;
	220
	221	/* pin the task and mm whilst we play with them */
2c03376d	222	priv->task = get_proc_task(priv->inode);
dbf8685c	223	if (!priv->task)
ec6fd8a4	224	return ERR_PTR(-ESRCH);
dbf8685c	225
27692cd5	226	mm = priv->mm;
388f7934	227	if (!mm \|\| !mmget_not_zero(mm))
27692cd5	228	return NULL;
dbf8685c	229
47fecca1	230	down_read(&mm->mmap_sem);
dbf8685c	231	/* start from the Nth VMA */
8feae131	232	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
dbf8685c	233	if (n-- == 0)
8feae131	234	return p;
47fecca1 ON	235
	236	up_read(&mm->mmap_sem);
	237	mmput(mm);
1da177e4 LT	238	return NULL;
1da177e4 LT	239	}
dbf8685c DH	240
dbf8685c DH	241	static void m_stop(struct seq_file m, void _vml)
1da177e4	242	{
dbf8685c DH	243	struct proc_maps_private *priv = m->private;
dbf8685c DH	244
47fecca1 ON	245	if (!IS_ERR_OR_NULL(_vml)) {
	246	up_read(&priv->mm->mmap_sem);
	247	mmput(priv->mm);
	248	}
dbf8685c	249	if (priv->task) {
dbf8685c	250	put_task_struct(priv->task);
47fecca1	251	priv->task = NULL;
dbf8685c	252	}
1da177e4	253	}
dbf8685c	254
8feae131	255	static void m_next(struct seq_file m, void _p, loff_t pos)
1da177e4	256	{
8feae131	257	struct rb_node *p = _p;
dbf8685c DH	258
dbf8685c DH	259	(*pos)++;
8feae131	260	return p ? rb_next(p) : NULL;
1da177e4	261	}
dbf8685c	262
03a44825	263	static const struct seq_operations proc_pid_maps_ops = {
1da177e4 LT	264	.start = m_start,
	265	.next = m_next,
	266	.stop = m_stop,
b7643757 SP	267	.show = show_pid_map
	268	};
	269
	270	static const struct seq_operations proc_tid_maps_ops = {
	271	.start = m_start,
	272	.next = m_next,
	273	.stop = m_stop,
	274	.show = show_tid_map
1da177e4	275	};
662795de	276
b7643757 SP	277	static int maps_open(struct inode inode, struct file file,
b7643757 SP	278	const struct seq_operations *ops)
662795de	279	{
dbf8685c	280	struct proc_maps_private *priv;
ce34fddb	281
27692cd5	282	priv = __seq_open_private(file, ops, sizeof(*priv));
ce34fddb ON	283	if (!priv)
	284	return -ENOMEM;
	285
2c03376d	286	priv->inode = inode;
27692cd5 ON	287	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
	288	if (IS_ERR(priv->mm)) {
	289	int err = PTR_ERR(priv->mm);
	290
	291	seq_release_private(inode, file);
	292	return err;
	293	}
	294
ce34fddb	295	return 0;
662795de EB	296	}
662795de EB	297
27692cd5 ON	298
	299	static int map_release(struct inode inode, struct file file)
	300	{
	301	struct seq_file *seq = file->private_data;
	302	struct proc_maps_private *priv = seq->private;
	303
	304	if (priv->mm)
	305	mmdrop(priv->mm);
	306
	307	return seq_release_private(inode, file);
	308	}
	309
b7643757 SP	310	static int pid_maps_open(struct inode inode, struct file file)
	311	{
	312	return maps_open(inode, file, &proc_pid_maps_ops);
	313	}
	314
	315	static int tid_maps_open(struct inode inode, struct file file)
	316	{
	317	return maps_open(inode, file, &proc_tid_maps_ops);
	318	}
	319
	320	const struct file_operations proc_pid_maps_operations = {
	321	.open = pid_maps_open,
	322	.read = seq_read,
	323	.llseek = seq_lseek,
27692cd5	324	.release = map_release,
b7643757 SP	325	};
	326
	327	const struct file_operations proc_tid_maps_operations = {
	328	.open = tid_maps_open,
662795de EB	329	.read = seq_read,
662795de EB	330	.llseek = seq_lseek,
27692cd5	331	.release = map_release,
662795de EB	332	};
662795de EB	333