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