Home | History | Annotate | Line # | Download | only in procfs
procfs_subr.c revision 1.4
      1  1.1       pk /*
      2  1.2       pk  * Copyright (c) 1993 Paul Kranenburg
      3  1.2       pk  * All rights reserved.
      4  1.2       pk  *
      5  1.2       pk  * Redistribution and use in source and binary forms, with or without
      6  1.2       pk  * modification, are permitted provided that the following conditions
      7  1.2       pk  * are met:
      8  1.2       pk  * 1. Redistributions of source code must retain the above copyright
      9  1.2       pk  *    notice, this list of conditions and the following disclaimer.
     10  1.2       pk  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.2       pk  *    notice, this list of conditions and the following disclaimer in the
     12  1.2       pk  *    documentation and/or other materials provided with the distribution.
     13  1.2       pk  * 3. All advertising materials mentioning features or use of this software
     14  1.2       pk  *    must display the following acknowledgement:
     15  1.3       pk  *      This product includes software developed by Paul Kranenburg.
     16  1.2       pk  * 4. The name of the author may not be used to endorse or promote products
     17  1.2       pk  *    derived from this software withough specific prior written permission
     18  1.2       pk  *
     19  1.2       pk  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     20  1.2       pk  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     21  1.2       pk  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     22  1.2       pk  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     23  1.2       pk  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     24  1.2       pk  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     25  1.2       pk  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     26  1.2       pk  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     27  1.2       pk  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     28  1.2       pk  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     29  1.2       pk  *
     30  1.4  mycroft  *	$Id: procfs_subr.c,v 1.4 1993/12/18 03:58:08 mycroft Exp $
     31  1.1       pk  */
     32  1.4  mycroft #include <sys/param.h>
     33  1.4  mycroft #include <sys/systm.h>
     34  1.4  mycroft #include <sys/time.h>
     35  1.4  mycroft #include <sys/kernel.h>
     36  1.4  mycroft #include <sys/ioctl.h>
     37  1.4  mycroft #include <sys/proc.h>
     38  1.4  mycroft #include <sys/buf.h>
     39  1.4  mycroft #include <sys/vnode.h>
     40  1.4  mycroft #include <sys/file.h>
     41  1.4  mycroft #include <sys/resourcevar.h>
     42  1.4  mycroft #include <vm/vm.h>
     43  1.4  mycroft #include <vm/vm_page.h>
     44  1.4  mycroft #include <vm/vm_kern.h>
     45  1.4  mycroft #include <sys/kinfo.h>
     46  1.4  mycroft #include <sys/kinfo_proc.h>
     47  1.1       pk 
     48  1.4  mycroft #include <sys/procfs.h>
     49  1.4  mycroft #include <miscfs/procfs/pfsnode.h>
     50  1.1       pk 
     51  1.4  mycroft #include <machine/vmparam.h>
     52  1.1       pk 
     53  1.1       pk /*
     54  1.1       pk  * Get process address map (PIOCGMAP)
     55  1.1       pk  */
     56  1.1       pk int
     57  1.1       pk pfs_vmmap(procp, pfsp, pmapp)
     58  1.1       pk struct proc	*procp;
     59  1.1       pk struct nfsnode	*pfsp;
     60  1.1       pk struct procmap	*pmapp;
     61  1.1       pk {
     62  1.1       pk 	int		error = 0;
     63  1.1       pk 	vm_map_t	map;
     64  1.1       pk 	vm_map_entry_t	entry;
     65  1.1       pk 	struct procmap	prmap;
     66  1.1       pk 
     67  1.1       pk 	map = &procp->p_vmspace->vm_map;
     68  1.1       pk 	vm_map_lock(map);
     69  1.1       pk 	entry = map->header.next;
     70  1.1       pk 
     71  1.1       pk 	while (entry != &map->header) {
     72  1.1       pk 		if (entry->is_a_map) {
     73  1.1       pk 			vm_map_t	submap = entry->object.share_map;
     74  1.1       pk 			vm_map_entry_t	subentry;
     75  1.1       pk 
     76  1.1       pk 			vm_map_lock(submap);
     77  1.1       pk 			subentry = submap->header.next;
     78  1.1       pk 			while (subentry != &submap->header) {
     79  1.1       pk 				prmap.vaddr = subentry->start;
     80  1.1       pk 				prmap.size = subentry->end - subentry->start;
     81  1.1       pk 				prmap.offset = subentry->offset;
     82  1.1       pk 				prmap.prot = subentry->protection;
     83  1.1       pk 				error = copyout(&prmap, pmapp, sizeof(prmap));
     84  1.1       pk 				if (error)
     85  1.1       pk 					break;
     86  1.1       pk 				pmapp++;
     87  1.1       pk 				subentry = subentry->next;
     88  1.1       pk 			}
     89  1.1       pk 			vm_map_unlock(submap);
     90  1.1       pk 			if (error)
     91  1.1       pk 				break;
     92  1.1       pk 		}
     93  1.1       pk 		prmap.vaddr = entry->start;
     94  1.1       pk 		prmap.size = entry->end - entry->start;
     95  1.1       pk 		prmap.offset = entry->offset;
     96  1.1       pk 		prmap.prot = entry->protection;
     97  1.1       pk 		error = copyout(&prmap, pmapp, sizeof(prmap));
     98  1.1       pk 		if (error)
     99  1.1       pk 			break;
    100  1.1       pk 		pmapp++;
    101  1.1       pk 		entry = entry->next;
    102  1.1       pk 	}
    103  1.1       pk 
    104  1.1       pk 	vm_map_unlock(map);
    105  1.1       pk 	return error;
    106  1.1       pk }
    107  1.1       pk 
    108  1.1       pk /*
    109  1.1       pk  * Count number of VM entries of process (PIOCNMAP)
    110  1.1       pk  */
    111  1.1       pk int
    112  1.1       pk pfs_vm_nentries(procp, pfsp)
    113  1.1       pk struct proc	*procp;
    114  1.1       pk struct nfsnode	*pfsp;
    115  1.1       pk {
    116  1.1       pk 	int		count = 0;
    117  1.1       pk 	vm_map_t	map;
    118  1.1       pk 	vm_map_entry_t	entry;
    119  1.1       pk 
    120  1.1       pk 	map = &procp->p_vmspace->vm_map;
    121  1.1       pk 	vm_map_lock(map);
    122  1.1       pk 	entry = map->header.next;
    123  1.1       pk 
    124  1.1       pk 	while (entry != &map->header) {
    125  1.1       pk 		if (entry->is_a_map)
    126  1.1       pk 			count += entry->object.share_map->nentries;
    127  1.1       pk 		else
    128  1.1       pk 			count++;
    129  1.1       pk 		entry = entry->next;
    130  1.1       pk 	}
    131  1.1       pk 
    132  1.1       pk 	vm_map_unlock(map);
    133  1.1       pk 	return count;
    134  1.1       pk }
    135  1.1       pk 
    136  1.1       pk /*
    137  1.1       pk  * Map process mapped file to file descriptor (PIOCGMAPFD)
    138  1.1       pk  */
    139  1.1       pk int
    140  1.1       pk pfs_vmfd(procp, pfsp, vmfdp, p)
    141  1.1       pk struct proc	*procp;
    142  1.1       pk struct pfsnode	*pfsp;
    143  1.1       pk struct vmfd	*vmfdp;
    144  1.1       pk struct proc	*p;
    145  1.1       pk {
    146  1.1       pk 	int		rv;
    147  1.1       pk 	vm_map_t	map;
    148  1.1       pk 	vm_offset_t	addr;
    149  1.1       pk 	vm_size_t	size;
    150  1.1       pk 	vm_prot_t	prot, maxprot;
    151  1.1       pk 	vm_inherit_t	inherit;
    152  1.1       pk 	boolean_t	shared;
    153  1.1       pk 	vm_object_t	object;
    154  1.1       pk 	vm_offset_t	objoff;
    155  1.1       pk 	struct vnode	*vp;
    156  1.1       pk 	struct file	*fp;
    157  1.1       pk 	extern struct fileops	vnops;
    158  1.1       pk 
    159  1.1       pk 	map = &procp->p_vmspace->vm_map;
    160  1.1       pk 
    161  1.1       pk 	addr = vmfdp->vaddr;
    162  1.1       pk 	rv = vm_region(map, &addr, &size, &prot, &maxprot,
    163  1.1       pk 			&inherit, &shared, &object, &objoff);
    164  1.1       pk 
    165  1.1       pk 	if (rv != KERN_SUCCESS)
    166  1.1       pk 		return EINVAL;
    167  1.1       pk 
    168  1.1       pk 	while (object != NULL && object->pager == NULL)
    169  1.1       pk 		object = object->shadow;
    170  1.1       pk 
    171  1.1       pk 	if (object == NULL || object->pager == NULL
    172  1.1       pk 			/* Nobody seems to care || !object->pager_ready */ )
    173  1.1       pk 		return ENOENT;
    174  1.1       pk 
    175  1.1       pk 	if (object->pager->pg_type != PG_VNODE)
    176  1.1       pk 		return ENOENT;
    177  1.1       pk 
    178  1.1       pk 	/* We have a vnode pager, allocate file descriptor */
    179  1.1       pk 	vp = (struct vnode *)object->pager->pg_handle;
    180  1.1       pk 	if (VOP_ACCESS(vp, VREAD, p->p_ucred, p)) {
    181  1.1       pk 		rv = EACCES;
    182  1.1       pk 		goto out;
    183  1.1       pk 	}
    184  1.1       pk 	rv = falloc(p, &fp, &vmfdp->fd);
    185  1.1       pk 	if (rv)
    186  1.1       pk 		goto out;
    187  1.1       pk 
    188  1.1       pk 	VREF(vp);
    189  1.1       pk 	fp->f_type = DTYPE_VNODE;
    190  1.1       pk 	fp->f_ops = &vnops;
    191  1.1       pk 	fp->f_data = (caddr_t)vp;
    192  1.1       pk 	fp->f_flag = FREAD;
    193  1.1       pk 
    194  1.1       pk out:
    195  1.1       pk 	vm_object_unlock(object);
    196  1.1       pk 	return rv;
    197  1.1       pk }
    198  1.1       pk 
    199  1.1       pk /*
    200  1.1       pk  * Vnode op for reading/writing.
    201  1.1       pk  */
    202  1.1       pk /* ARGSUSED */
    203  1.1       pk pfs_doio(vp, uio, ioflag, cred)
    204  1.1       pk 	struct vnode *vp;
    205  1.1       pk 	register struct uio *uio;
    206  1.1       pk 	int ioflag;
    207  1.1       pk 	struct ucred *cred;
    208  1.1       pk {
    209  1.1       pk 	struct pfsnode	*pfsp = VTOPFS(vp);
    210  1.1       pk 	struct proc	*procp;
    211  1.1       pk 	int		error = 0;
    212  1.1       pk 	long		n, on;
    213  1.1       pk 
    214  1.1       pk #ifdef DEBUG
    215  1.1       pk 	if (pfs_debug)
    216  1.1       pk 		printf("pfs_doio(%s): vp 0x%x, proc %x\n",
    217  1.1       pk 			uio->uio_rw==UIO_READ?"R":"W", vp, uio->uio_procp);
    218  1.1       pk #endif
    219  1.1       pk 
    220  1.1       pk #ifdef DIAGNOSTIC
    221  1.1       pk 	if (vp->v_type != VPROC)
    222  1.1       pk 		panic("pfs_doio vtype");
    223  1.1       pk #endif
    224  1.1       pk 	procp = pfsp->pfs_pid?pfind(pfsp->pfs_pid):&proc0;
    225  1.1       pk 	if (!procp)
    226  1.1       pk 		return ESRCH;
    227  1.1       pk 
    228  1.1       pk 	if (procp->p_flag & SSYS)
    229  1.1       pk 		return EACCES;
    230  1.1       pk 
    231  1.1       pk 	if (uio->uio_resid == 0)
    232  1.1       pk 		return (0);
    233  1.1       pk 	if (uio->uio_offset < 0)
    234  1.1       pk 		return (EINVAL);
    235  1.1       pk 
    236  1.1       pk 	do { /* One page at a time */
    237  1.1       pk 		int		rv;
    238  1.1       pk 		vm_map_t	map;
    239  1.1       pk 		vm_offset_t	offset;
    240  1.1       pk 		vm_size_t	size;
    241  1.1       pk 		vm_prot_t	oldprot = 0, prot, maxprot;
    242  1.1       pk 		vm_inherit_t	inherit;
    243  1.1       pk 		boolean_t	shared;
    244  1.1       pk 		vm_object_t	object;
    245  1.1       pk 		vm_offset_t	objoff;
    246  1.1       pk 		vm_page_t	m;
    247  1.1       pk 		vm_offset_t	kva;
    248  1.1       pk 
    249  1.1       pk 		on = uio->uio_offset - trunc_page(uio->uio_offset);
    250  1.1       pk 		n = MIN(PAGE_SIZE-on, uio->uio_resid);
    251  1.1       pk 
    252  1.1       pk 		/* Map page into kernel space */
    253  1.1       pk 
    254  1.1       pk 		map = &procp->p_vmspace->vm_map;
    255  1.1       pk #if 0
    256  1.1       pk 	vm_map_print(map, 1);
    257  1.1       pk #endif
    258  1.1       pk 
    259  1.1       pk 		offset = trunc_page(uio->uio_offset);
    260  1.1       pk 
    261  1.1       pk 		rv = vm_region(map, &offset, &size, &prot, &maxprot,
    262  1.1       pk 				&inherit, &shared, &object, &objoff);
    263  1.1       pk 		if (rv != KERN_SUCCESS)
    264  1.1       pk 			return EINVAL;
    265  1.1       pk 
    266  1.1       pk 		vm_object_unlock(object);
    267  1.1       pk 
    268  1.1       pk 		if (uio->uio_rw == UIO_WRITE && (prot & VM_PROT_WRITE) == 0) {
    269  1.1       pk 			oldprot = prot;
    270  1.1       pk 			prot |= VM_PROT_WRITE;
    271  1.1       pk 			rv = vm_protect(map, offset, PAGE_SIZE, FALSE, prot);
    272  1.1       pk 			if (rv != KERN_SUCCESS)
    273  1.1       pk 				return EPERM;
    274  1.1       pk 		}
    275  1.1       pk 		/* Just fault the page */
    276  1.1       pk 		rv = vm_fault(map, offset, prot, FALSE);
    277  1.1       pk 		if (rv != KERN_SUCCESS)
    278  1.1       pk 			return EFAULT;
    279  1.1       pk 
    280  1.1       pk 		/* Look up again as vm_fault() may have inserted a shadow object */
    281  1.1       pk 		rv = vm_region(map, &offset, &size, &prot, &maxprot,
    282  1.1       pk 				&inherit, &shared, &object, &objoff);
    283  1.1       pk 		if (rv != KERN_SUCCESS)
    284  1.1       pk 			return EINVAL;
    285  1.1       pk 
    286  1.1       pk 		/* Now find the page */
    287  1.1       pk 		/* XXX hope it's still there, should we have wired it? */
    288  1.1       pk 		m = vm_page_lookup(object, objoff);
    289  1.1       pk 		if (m == NULL)
    290  1.1       pk 			return ESRCH;
    291  1.1       pk 
    292  1.1       pk 		kva = kmem_alloc_wait(kernel_map, PAGE_SIZE);
    293  1.1       pk 
    294  1.1       pk 		pmap_enter(vm_map_pmap(kernel_map), kva, VM_PAGE_TO_PHYS(m),
    295  1.1       pk 			VM_PROT_DEFAULT, TRUE);
    296  1.1       pk 
    297  1.1       pk 		error = uiomove(kva + on, (int)n, uio);
    298  1.1       pk 
    299  1.1       pk 		pmap_remove(vm_map_pmap(kernel_map), kva, kva + PAGE_SIZE);
    300  1.1       pk 		kmem_free_wakeup(kernel_map, kva, PAGE_SIZE);
    301  1.1       pk 		if (oldprot) {
    302  1.1       pk 			rv = vm_protect(map, offset, PAGE_SIZE, FALSE, oldprot);
    303  1.1       pk 			if (rv != KERN_SUCCESS)
    304  1.1       pk 				return EPERM;
    305  1.1       pk 		}
    306  1.1       pk 
    307  1.1       pk 	} while (error == 0 && uio->uio_resid > 0);
    308  1.1       pk 
    309  1.1       pk 	return (error);
    310  1.1       pk }
    311  1.1       pk 
    312  1.1       pk #if 00
    313  1.1       pk int
    314  1.1       pk pfs_map(procp, kva, rw, offset)
    315  1.1       pk struct proc	*procp;
    316  1.1       pk int		rw;
    317  1.1       pk vm_offset_t	*kva, offset;
    318  1.1       pk {
    319  1.1       pk 	int		rv;
    320  1.1       pk 	vm_map_t	map;
    321  1.1       pk 	vm_size_t	size;
    322  1.1       pk 	vm_prot_t	prot, maxprot;
    323  1.1       pk 	vm_inherit_t	inherit;
    324  1.1       pk 	boolean_t	shared;
    325  1.1       pk 	vm_object_t	object;
    326  1.1       pk 	vm_offset_t	objoff;
    327  1.1       pk 	vm_page_t	m;
    328  1.1       pk 
    329  1.1       pk 	map = &procp->p_vmspace->vm_map;
    330  1.1       pk #if 0
    331  1.1       pk 	vm_map_print(map, 1);
    332  1.1       pk #endif
    333  1.1       pk 
    334  1.1       pk 	offset = trunc_page(offset);
    335  1.1       pk 
    336  1.1       pk 	rv = vm_region(map, &offset, &size, &prot, &maxprot,
    337  1.1       pk 			&inherit, &shared, &object, &objoff);
    338  1.1       pk 	if (rv != KERN_SUCCESS)
    339  1.1       pk 		return EINVAL;
    340  1.1       pk 
    341  1.1       pk 	vm_object_unlock(object);
    342  1.1       pk 
    343  1.1       pk 	if (rw == UIO_WRITE && (prot & VM_PROT_WRITE) == 0) {
    344  1.1       pk 		prot |= VM_PROT_WRITE;
    345  1.1       pk 		rv = vm_protect(map, offset, PAGE_SIZE, FALSE, prot);
    346  1.1       pk 		if (rv != KERN_SUCCESS)
    347  1.1       pk 			return EPERM;
    348  1.1       pk 	}
    349  1.1       pk 	/* Just fault page */
    350  1.1       pk 	rv = vm_fault(map, offset, prot, FALSE);
    351  1.1       pk 	if (rv != KERN_SUCCESS)
    352  1.1       pk 		return EFAULT;
    353  1.1       pk 
    354  1.1       pk 	/* Look up again as vm_fault() may have inserted a shadow object */
    355  1.1       pk 	rv = vm_region(map, &offset, &size, &prot, &maxprot,
    356  1.1       pk 			&inherit, &shared, &object, &objoff);
    357  1.1       pk 	if (rv != KERN_SUCCESS)
    358  1.1       pk 		return EINVAL;
    359  1.1       pk 
    360  1.1       pk 	m = vm_page_lookup(object, objoff);
    361  1.1       pk 	if (m == NULL)
    362  1.1       pk 		return ESRCH;
    363  1.1       pk 
    364  1.1       pk 	*kva = kmem_alloc_wait(kernel_map, PAGE_SIZE);
    365  1.1       pk 
    366  1.1       pk 	pmap_enter(vm_map_pmap(kernel_map), *kva, VM_PAGE_TO_PHYS(m),
    367  1.1       pk 			VM_PROT_DEFAULT, TRUE);
    368  1.1       pk 
    369  1.1       pk 	return 0;
    370  1.1       pk }
    371  1.1       pk 
    372  1.1       pk int
    373  1.1       pk pfs_unmap(procp, kva)
    374  1.1       pk struct proc	*procp;
    375  1.1       pk vm_offset_t	kva;
    376  1.1       pk {
    377  1.1       pk 	pmap_remove(vm_map_pmap(kernel_map), kva, kva + PAGE_SIZE);
    378  1.1       pk 	kmem_free_wakeup(kernel_map, kva, PAGE_SIZE);
    379  1.1       pk }
    380  1.1       pk #endif
    381