[linux-block.git] / fs / proc / task_nommu.c

// SPDX-License-Identifier: GPL-2.0

#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 && refcount_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 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)
{
	struct mm_struct *mm = vma->vm_mm;
	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_inode(vma->vm_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(vma)) {
		seq_pad(m, ' ');
		seq_puts(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)
{
	struct rb_node *p = _p;

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

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;

	if (down_read_killable(&mm->mmap_sem)) {
		mmput(mm);
		return ERR_PTR(-EINTR);
	}

	/* 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_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);
}

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