[linux-2.6-block.git] / fs / proc / nommu.c

/* nommu.c: mmu-less memory info files
 *
 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */

#include <linux/init.h>
#include <linux/module.h>
#include <linux/errno.h>
#include <linux/time.h>
#include <linux/kernel.h>
#include <linux/string.h>
#include <linux/mman.h>
#include <linux/proc_fs.h>
#include <linux/mm.h>
#include <linux/mmzone.h>
#include <linux/pagemap.h>
#include <linux/swap.h>
#include <linux/slab.h>
#include <linux/smp.h>
#include <linux/seq_file.h>
#include <linux/hugetlb.h>
#include <linux/vmalloc.h>
#include <asm/uaccess.h>
#include <asm/pgtable.h>
#include <asm/tlb.h>
#include <asm/div64.h>
#include "internal.h"

/*
 * display a single VMA to a sequenced file
 */
int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma)
{
	unsigned long ino = 0;
	struct file *file;
	dev_t dev = 0;
	int flags, len;

	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;
	}

	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',
		   ((loff_t)vma->vm_pgoff) << PAGE_SHIFT,
		   MAJOR(dev), MINOR(dev), ino, &len);

	if (file) {
		len = 25 + sizeof(void *) * 6 - len;
		if (len < 1)
			len = 1;
		seq_printf(m, "%*c", len, ' ');
		seq_path(m, &file->f_path, "");
	}

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

/*
 * display a list of all the VMAs the kernel knows about
 * - nommu kernals have a single flat list
 */
static int nommu_vma_list_show(struct seq_file *m, void *v)
{
	struct vm_area_struct *vma;

	vma = rb_entry((struct rb_node *) v, struct vm_area_struct, vm_rb);
	return nommu_vma_show(m, vma);
}

static void *nommu_vma_list_start(struct seq_file *m, loff_t *_pos)
{
	struct rb_node *_rb;
	loff_t pos = *_pos;
	void *next = NULL;

	down_read(&nommu_vma_sem);

	for (_rb = rb_first(&nommu_vma_tree); _rb; _rb = rb_next(_rb)) {
		if (pos == 0) {
			next = _rb;
			break;
		}
		pos--;
	}

	return next;
}

static void nommu_vma_list_stop(struct seq_file *m, void *v)
{
	up_read(&nommu_vma_sem);
}

static void *nommu_vma_list_next(struct seq_file *m, void *v, loff_t *pos)
{
	(*pos)++;
	return rb_next((struct rb_node *) v);
}

static const struct seq_operations proc_nommu_vma_list_seqop = {
	.start	= nommu_vma_list_start,
	.next	= nommu_vma_list_next,
	.stop	= nommu_vma_list_stop,
	.show	= nommu_vma_list_show
};

static int proc_nommu_vma_list_open(struct inode *inode, struct file *file)
{
	return seq_open(file, &proc_nommu_vma_list_seqop);
}

static const struct file_operations proc_nommu_vma_list_operations = {
	.open    = proc_nommu_vma_list_open,
	.read    = seq_read,
	.llseek  = seq_lseek,
	.release = seq_release,
};

static int __init proc_nommu_init(void)
{
	proc_create("maps", S_IRUGO, NULL, &proc_nommu_vma_list_operations);
	return 0;
}

module_init(proc_nommu_init);
Commit	Line	Data
1da177e4 LT	1	/* nommu.c: mmu-less memory info files
	2	*
	3	* Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
	4	* Written by David Howells (dhowells@redhat.com)
	5	*
	6	* This program is free software; you can redistribute it and/or
	7	* modify it under the terms of the GNU General Public License
	8	* as published by the Free Software Foundation; either version
	9	* 2 of the License, or (at your option) any later version.
	10	*/
	11
	12	#include <linux/init.h>
	13	#include <linux/module.h>
	14	#include <linux/errno.h>
	15	#include <linux/time.h>
	16	#include <linux/kernel.h>
	17	#include <linux/string.h>
	18	#include <linux/mman.h>
	19	#include <linux/proc_fs.h>
	20	#include <linux/mm.h>
	21	#include <linux/mmzone.h>
	22	#include <linux/pagemap.h>
	23	#include <linux/swap.h>
	24	#include <linux/slab.h>
	25	#include <linux/smp.h>
	26	#include <linux/seq_file.h>
	27	#include <linux/hugetlb.h>
	28	#include <linux/vmalloc.h>
	29	#include <asm/uaccess.h>
	30	#include <asm/pgtable.h>
	31	#include <asm/tlb.h>
	32	#include <asm/div64.h>
	33	#include "internal.h"
	34
	35	/*
dbf8685c	36	* display a single VMA to a sequenced file
1da177e4	37	*/
dbf8685c	38	int nommu_vma_show(struct seq_file m, struct vm_area_struct vma)
1da177e4	39	{
1da177e4 LT	40	unsigned long ino = 0;
	41	struct file *file;
	42	dev_t dev = 0;
	43	int flags, len;
	44
1da177e4 LT	45	flags = vma->vm_flags;
	46	file = vma->vm_file;
	47
	48	if (file) {
2fddfeef	49	struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
1da177e4 LT	50	dev = inode->i_sb->s_dev;
	51	ino = inode->i_ino;
	52	}
	53
	54	seq_printf(m,
1804dc6e	55	"%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
1da177e4 LT	56	vma->vm_start,
	57	vma->vm_end,
	58	flags & VM_READ ? 'r' : '-',
	59	flags & VM_WRITE ? 'w' : '-',
	60	flags & VM_EXEC ? 'x' : '-',
	61	flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
1804dc6e	62	((loff_t)vma->vm_pgoff) << PAGE_SHIFT,
1da177e4 LT	63	MAJOR(dev), MINOR(dev), ino, &len);
	64
	65	if (file) {
	66	len = 25 + sizeof(void ) 6 - len;
	67	if (len < 1)
	68	len = 1;
	69	seq_printf(m, "%*c", len, ' ');
c32c2f63	70	seq_path(m, &file->f_path, "");
1da177e4 LT	71	}
	72
	73	seq_putc(m, '\n');
	74	return 0;
	75	}
	76
dbf8685c DH	77	/*
	78	* display a list of all the VMAs the kernel knows about
	79	* - nommu kernals have a single flat list
	80	*/
	81	static int nommu_vma_list_show(struct seq_file m, void v)
	82	{
	83	struct vm_area_struct *vma;
	84
	85	vma = rb_entry((struct rb_node *) v, struct vm_area_struct, vm_rb);
	86	return nommu_vma_show(m, vma);
	87	}
	88
1da177e4 LT	89	static void nommu_vma_list_start(struct seq_file m, loff_t *_pos)
	90	{
	91	struct rb_node *_rb;
	92	loff_t pos = *_pos;
	93	void *next = NULL;
	94
	95	down_read(&nommu_vma_sem);
	96
	97	for (_rb = rb_first(&nommu_vma_tree); _rb; _rb = rb_next(_rb)) {
	98	if (pos == 0) {
	99	next = _rb;
	100	break;
	101	}
b65574fe	102	pos--;
1da177e4 LT	103	}
	104
	105	return next;
	106	}
	107
	108	static void nommu_vma_list_stop(struct seq_file m, void v)
	109	{
	110	up_read(&nommu_vma_sem);
	111	}
	112
	113	static void nommu_vma_list_next(struct seq_file m, void v, loff_t pos)
	114	{
	115	(*pos)++;
	116	return rb_next((struct rb_node *) v);
	117	}
	118
03a44825	119	static const struct seq_operations proc_nommu_vma_list_seqop = {
1da177e4 LT	120	.start = nommu_vma_list_start,
	121	.next = nommu_vma_list_next,
	122	.stop = nommu_vma_list_stop,
	123	.show = nommu_vma_list_show
	124	};
	125
	126	static int proc_nommu_vma_list_open(struct inode inode, struct file file)
	127	{
	128	return seq_open(file, &proc_nommu_vma_list_seqop);
	129	}
	130
00977a59	131	static const struct file_operations proc_nommu_vma_list_operations = {
1da177e4 LT	132	.open = proc_nommu_vma_list_open,
	133	.read = seq_read,
	134	.llseek = seq_lseek,
	135	.release = seq_release,
	136	};
	137
	138	static int __init proc_nommu_init(void)
	139	{
0d5c9f5f	140	proc_create("maps", S_IRUGO, NULL, &proc_nommu_vma_list_operations);
1da177e4 LT	141	return 0;
	142	}
	143
	144	module_init(proc_nommu_init);