xref: /netbsd-src/sys/miscfs/procfs/procfs_map.c (revision b0ec16cc38aef84d6673f266504c47e79fe2c589)
1 /*	$NetBSD: procfs_map.c,v 1.9 2000/11/24 18:58:37 chs Exp $	*/
2 
3 /*
4  * Copyright (c) 1993 Jan-Simon Pendry
5  * Copyright (c) 1993
6  *	The Regents of the University of California.  All rights reserved.
7  *
8  * This code is derived from software contributed to Berkeley by
9  * Jan-Simon Pendry.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. All advertising materials mentioning features or use of this software
20  *    must display the following acknowledgement:
21  *	This product includes software developed by the University of
22  *	California, Berkeley and its contributors.
23  * 4. Neither the name of the University nor the names of its contributors
24  *    may be used to endorse or promote products derived from this software
25  *    without specific prior written permission.
26  *
27  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37  * SUCH DAMAGE.
38  *
39  *	@(#)procfs_status.c	8.3 (Berkeley) 2/17/94
40  *
41  *	$FreeBSD: procfs_map.c,v 1.18 1998/12/04 22:54:51 archie Exp $
42  */
43 
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/proc.h>
47 #include <sys/vnode.h>
48 #include <miscfs/procfs/procfs.h>
49 
50 #include <sys/lock.h>
51 
52 #include <uvm/uvm.h>
53 
54 #define MEBUFFERSIZE 256
55 
56 /*
57  * The map entries can *almost* be read with programs like cat.  However,
58  * large maps need special programs to read.  It is not easy to implement
59  * a program that can sense the required size of the buffer, and then
60  * subsequently do a read with the appropriate size.  This operation cannot
61  * be atomic.  The best that we can do is to allow the program to do a read
62  * with an arbitrarily large buffer, and return as much as we can.  We can
63  * return an error code if the buffer is too small (EFBIG), then the program
64  * can try a bigger buffer.
65  */
66 int
67 procfs_domap(curp, p, pfs, uio)
68 	struct proc *curp;
69 	struct proc *p;
70 	struct pfsnode *pfs;
71 	struct uio *uio;
72 {
73 	int len;
74 	int error;
75 	vm_map_t map = &p->p_vmspace->vm_map;
76 	vm_map_entry_t entry;
77 	char mebuffer[MEBUFFERSIZE];
78 
79 	if (uio->uio_rw != UIO_READ)
80 		return (EOPNOTSUPP);
81 
82 	if (uio->uio_offset != 0)
83 		return (0);
84 
85 	error = 0;
86 	if (map != &curproc->p_vmspace->vm_map)
87 		vm_map_lock_read(map);
88 	for (entry = map->header.next;
89 		((uio->uio_resid > 0) && (entry != &map->header));
90 		entry = entry->next) {
91 
92 		if (UVM_ET_ISSUBMAP(entry))
93 			continue;
94 
95 		snprintf(mebuffer, sizeof(mebuffer),
96 		    "0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d\n",
97 		    entry->start, entry->end,
98 		    (entry->protection & VM_PROT_READ) ? 'r' : '-',
99 		    (entry->protection & VM_PROT_WRITE) ? 'w' : '-',
100 		    (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-',
101 		    (entry->max_protection & VM_PROT_READ) ? 'r' : '-',
102 		    (entry->max_protection & VM_PROT_WRITE) ? 'w' : '-',
103 		    (entry->max_protection & VM_PROT_EXECUTE) ? 'x' : '-',
104 		    (entry->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW",
105 		    (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC",
106 		    entry->inheritance, entry->wired_count, entry->advice);
107 
108 		len = strlen(mebuffer);
109 		if (len > uio->uio_resid) {
110 			error = EFBIG;
111 			break;
112 		}
113 		error = uiomove(mebuffer, len, uio);
114 		if (error)
115 			break;
116 	}
117 	if (map != &curproc->p_vmspace->vm_map)
118 		vm_map_unlock_read(map);
119 	return error;
120 }
121 
122 int
123 procfs_validmap(p)
124 	struct proc *p;
125 {
126 	return ((p->p_flag & P_SYSTEM) == 0);
127 }
128