[GitHub/mt8127/android_kernel_alcatel_ttab.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 "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 void pad_len_spaces(struct seq_file *m, int len)
{
	len = 25 + sizeof(void*) * 6 - len;
	if (len < 1)
		len = 1;
	seq_printf(m, "%*c", len, ' ');
}

/*
 * 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, len;
	unsigned long long pgoff = 0;

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

	if (file) {
		struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
		pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
	}

	seq_printf(m,
		   "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
		   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, &len);

	if (file) {
		pad_len_spaces(m, len);
		seq_path(m, &file->f_path, "");
	} else if (mm) {
		if (vma->vm_start <= mm->start_stack &&
			vma->vm_end >= mm->start_stack) {
			pad_len_spaces(m, len);
			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_pid_task(priv->pid, PIDTYPE_PID);
	if (!priv->task)
		return NULL;

	mm = mm_for_maps(priv->task);
	if (!mm) {
		put_task_struct(priv->task);
		priv->task = NULL;
		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;
	return NULL;
}

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

	if (priv->task) {
		struct mm_struct *mm = priv->task->mm;
		up_read(&mm->mmap_sem);
		mmput(mm);
		put_task_struct(priv->task);
	}
}

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)
{
	struct proc_maps_private *priv;
	int ret = -ENOMEM;

	priv = kzalloc(sizeof(*priv), GFP_KERNEL);
	if (priv) {
		priv->pid = proc_pid(inode);
		ret = seq_open(file, &proc_pid_maps_ops);
		if (!ret) {
			struct seq_file *m = file->private_data;
			m->private = priv;
		} else {
			kfree(priv);
		}
	}
	return ret;
}

const struct file_operations proc_maps_operations = {
	.open		= maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release_private,
};
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
1da177e4 LT	25	down_read(&mm->mmap_sem);
8feae131 DH	26	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
8feae131 DH	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(&current->files->count) > 1)
	60	sbytes += kobjsize(current->files);
	61	else
	62	bytes += kobjsize(current->files);
	63
	64	if (current->sighand && atomic_read(&current->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;
8feae131 DH	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)) {
8feae131 DH	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
1da177e4 LT	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	}
1da177e4 LT	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;
7e1e0ef2 SM	121	size += text + data;
1da177e4 LT	122	*resident = size;
	123	return size;
	124	}
	125
3c26c9d9 MF	126	static void pad_len_spaces(struct seq_file *m, int len)
	127	{
	128	len = 25 + sizeof(void) 6 - len;
	129	if (len < 1)
	130	len = 1;
	131	seq_printf(m, "%*c", len, ' ');
	132	}
	133
8feae131 DH	134	/*
	135	* display a single VMA to a sequenced file
	136	*/
	137	static int nommu_vma_show(struct seq_file m, struct vm_area_struct vma)
	138	{
3c26c9d9	139	struct mm_struct *mm = vma->vm_mm;
8feae131 DH	140	unsigned long ino = 0;
	141	struct file *file;
	142	dev_t dev = 0;
	143	int flags, len;
6260a4b0	144	unsigned long long pgoff = 0;
8feae131 DH	145
	146	flags = vma->vm_flags;
	147	file = vma->vm_file;
	148
	149	if (file) {
	150	struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
	151	dev = inode->i_sb->s_dev;
	152	ino = inode->i_ino;
4c967291	153	pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
8feae131 DH	154	}
	155
	156	seq_printf(m,
33e5d769	157	"%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
8feae131 DH	158	vma->vm_start,
	159	vma->vm_end,
	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',
6260a4b0	164	pgoff,
8feae131 DH	165	MAJOR(dev), MINOR(dev), ino, &len);
	166
	167	if (file) {
3c26c9d9	168	pad_len_spaces(m, len);
8feae131	169	seq_path(m, &file->f_path, "");
3c26c9d9 MF	170	} else if (mm) {
	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]");
	175	}
8feae131 DH	176	}
	177
	178	seq_putc(m, '\n');
	179	return 0;
	180	}
	181
1da177e4	182	/*
dbf8685c	183	* display mapping lines for a particular process's /proc/pid/maps
1da177e4	184	*/
8feae131	185	static int show_map(struct seq_file m, void _p)
1da177e4	186	{
8feae131	187	struct rb_node *p = _p;
5096add8	188
8feae131	189	return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb));
1da177e4	190	}
dbf8685c	191
1da177e4 LT	192	static void m_start(struct seq_file m, loff_t *pos)
1da177e4 LT	193	{
dbf8685c	194	struct proc_maps_private *priv = m->private;
dbf8685c	195	struct mm_struct *mm;
8feae131	196	struct rb_node *p;
dbf8685c DH	197	loff_t n = *pos;
	198
	199	/* pin the task and mm whilst we play with them */
	200	priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
	201	if (!priv->task)
	202	return NULL;
	203
831830b5	204	mm = mm_for_maps(priv->task);
dbf8685c DH	205	if (!mm) {
	206	put_task_struct(priv->task);
	207	priv->task = NULL;
	208	return NULL;
	209	}
00f89d21	210	down_read(&mm->mmap_sem);
dbf8685c	211
dbf8685c	212	/* start from the Nth VMA */
8feae131	213	for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
dbf8685c	214	if (n-- == 0)
8feae131	215	return p;
1da177e4 LT	216	return NULL;
1da177e4 LT	217	}
dbf8685c DH	218
dbf8685c DH	219	static void m_stop(struct seq_file m, void _vml)
1da177e4	220	{
dbf8685c DH	221	struct proc_maps_private *priv = m->private;
	222
	223	if (priv->task) {
	224	struct mm_struct *mm = priv->task->mm;
	225	up_read(&mm->mmap_sem);
	226	mmput(mm);
	227	put_task_struct(priv->task);
	228	}
1da177e4	229	}
dbf8685c	230
8feae131	231	static void m_next(struct seq_file m, void _p, loff_t pos)
1da177e4	232	{
8feae131	233	struct rb_node *p = _p;
dbf8685c DH	234
dbf8685c DH	235	(*pos)++;
8feae131	236	return p ? rb_next(p) : NULL;
1da177e4	237	}
dbf8685c	238
03a44825	239	static const struct seq_operations proc_pid_maps_ops = {
1da177e4 LT	240	.start = m_start,
	241	.next = m_next,
	242	.stop = m_stop,
	243	.show = show_map
	244	};
662795de EB	245
	246	static int maps_open(struct inode inode, struct file file)
	247	{
dbf8685c DH	248	struct proc_maps_private *priv;
	249	int ret = -ENOMEM;
	250
	251	priv = kzalloc(sizeof(*priv), GFP_KERNEL);
	252	if (priv) {
	253	priv->pid = proc_pid(inode);
	254	ret = seq_open(file, &proc_pid_maps_ops);
	255	if (!ret) {
	256	struct seq_file *m = file->private_data;
	257	m->private = priv;
	258	} else {
	259	kfree(priv);
	260	}
662795de EB	261	}
	262	return ret;
	263	}
	264
00977a59	265	const struct file_operations proc_maps_operations = {
662795de EB	266	.open = maps_open,
	267	.read = seq_read,
	268	.llseek = seq_lseek,
dbf8685c	269	.release = seq_release_private,
662795de EB	270	};
662795de EB	271