2 * Copyright (c) 1993 Jan-Simon Pendry
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#)procfs_status.c 8.3 (Berkeley) 2/17/94
39 * $FreeBSD: src/sys/miscfs/procfs/procfs_map.c,v 1.24.2.1 2001/08/04 13:12:24 rwatson Exp $
42 #include <sys/param.h>
43 #include <sys/systm.h>
45 #include <sys/vnode.h>
46 #include <miscfs/procfs/procfs.h>
51 #include <vm/vm_map.h>
52 #include <vm/vm_page.h>
53 #include <vm/vm_object.h>
56 #define MEBUFFERSIZE 256
59 * The map entries can *almost* be read with programs like cat. However,
60 * large maps need special programs to read. It is not easy to implement
61 * a program that can sense the required size of the buffer, and then
62 * subsequently do a read with the appropriate size. This operation cannot
63 * be atomic. The best that we can do is to allow the program to do a read
64 * with an arbitrarily large buffer, and return as much as we can. We can
65 * return an error code if the buffer is too small (EFBIG), then the program
66 * can try a bigger buffer.
69 procfs_domap(curp, p, pfs, uio)
77 vm_map_t map = &p->p_vmspace->vm_map;
78 pmap_t pmap = vmspace_pmap(p->p_vmspace);
80 char mebuffer[MEBUFFERSIZE];
82 if (uio->uio_rw != UIO_READ)
85 if (uio->uio_offset != 0)
89 if (map != &curproc->p_vmspace->vm_map)
90 vm_map_lock_read(map);
91 for (entry = map->header.next;
92 ((uio->uio_resid > 0) && (entry != &map->header));
93 entry = entry->next) {
94 vm_object_t obj, tobj, lobj;
95 int ref_count, shadow_count, flags;
97 int resident, privateresident;
100 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
103 obj = entry->object.vm_object;
104 if (obj && (obj->shadow_count == 1))
105 privateresident = obj->resident_page_count;
111 while (addr < entry->end) {
112 if (pmap_extract( pmap, addr))
117 for( lobj = tobj = obj; tobj; tobj = tobj->backing_object)
139 ref_count = obj->ref_count;
140 shadow_count = obj->shadow_count;
151 * start, end, resident, private resident, cow, access, type.
153 snprintf(mebuffer, sizeof(mebuffer),
154 "0x%lx 0x%lx %d %d %p %s%s%s %d %d 0x%x %s %s %s\n",
155 (u_long)entry->start, (u_long)entry->end,
156 resident, privateresident, obj,
157 (entry->protection & VM_PROT_READ)?"r":"-",
158 (entry->protection & VM_PROT_WRITE)?"w":"-",
159 (entry->protection & VM_PROT_EXECUTE)?"x":"-",
160 ref_count, shadow_count, flags,
161 (entry->eflags & MAP_ENTRY_COW)?"COW":"NCOW",
162 (entry->eflags & MAP_ENTRY_NEEDS_COPY)?"NC":"NNC",
165 len = strlen(mebuffer);
166 if (len > uio->uio_resid) {
170 error = uiomove(mebuffer, len, uio);
174 if (map != &curproc->p_vmspace->vm_map)
175 vm_map_unlock_read(map);
184 return ((p->p_flag & P_SYSTEM) == 0);