Home | History | Annotate | Line # | Download | only in uvm
uvm_io.c revision 1.6
      1  1.6  eeh /*	$NetBSD: uvm_io.c,v 1.6 1998/08/13 02:11:00 eeh Exp $	*/
      2  1.1  mrg 
      3  1.1  mrg /*
      4  1.1  mrg  * XXXCDC: "ROUGH DRAFT" QUALITY UVM PRE-RELEASE FILE!
      5  1.1  mrg  *	   >>>USE AT YOUR OWN RISK, WORK IS NOT FINISHED<<<
      6  1.1  mrg  */
      7  1.1  mrg /*
      8  1.1  mrg  *
      9  1.1  mrg  * Copyright (c) 1997 Charles D. Cranor and Washington University.
     10  1.1  mrg  * All rights reserved.
     11  1.1  mrg  *
     12  1.1  mrg  * Redistribution and use in source and binary forms, with or without
     13  1.1  mrg  * modification, are permitted provided that the following conditions
     14  1.1  mrg  * are met:
     15  1.1  mrg  * 1. Redistributions of source code must retain the above copyright
     16  1.1  mrg  *    notice, this list of conditions and the following disclaimer.
     17  1.1  mrg  * 2. Redistributions in binary form must reproduce the above copyright
     18  1.1  mrg  *    notice, this list of conditions and the following disclaimer in the
     19  1.1  mrg  *    documentation and/or other materials provided with the distribution.
     20  1.1  mrg  * 3. All advertising materials mentioning features or use of this software
     21  1.1  mrg  *    must display the following acknowledgement:
     22  1.1  mrg  *      This product includes software developed by Charles D. Cranor and
     23  1.1  mrg  *      Washington University.
     24  1.1  mrg  * 4. The name of the author may not be used to endorse or promote products
     25  1.1  mrg  *    derived from this software without specific prior written permission.
     26  1.1  mrg  *
     27  1.1  mrg  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     28  1.1  mrg  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     29  1.1  mrg  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     30  1.1  mrg  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     31  1.1  mrg  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     32  1.1  mrg  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     33  1.1  mrg  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     34  1.1  mrg  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     35  1.1  mrg  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     36  1.1  mrg  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     37  1.3  mrg  *
     38  1.3  mrg  * from: Id: uvm_io.c,v 1.1.2.2 1997/12/30 12:02:00 mrg Exp
     39  1.1  mrg  */
     40  1.1  mrg 
     41  1.1  mrg /*
     42  1.1  mrg  * uvm_io.c: uvm i/o ops
     43  1.1  mrg  */
     44  1.1  mrg 
     45  1.1  mrg #include <sys/param.h>
     46  1.1  mrg #include <sys/systm.h>
     47  1.1  mrg #include <sys/mman.h>
     48  1.1  mrg #include <sys/proc.h>
     49  1.1  mrg #include <sys/malloc.h>
     50  1.1  mrg #include <sys/uio.h>
     51  1.1  mrg 
     52  1.1  mrg #include <vm/vm.h>
     53  1.1  mrg #include <vm/vm_page.h>
     54  1.1  mrg #include <vm/vm_kern.h>
     55  1.1  mrg 
     56  1.1  mrg #include <uvm/uvm.h>
     57  1.1  mrg 
     58  1.1  mrg /*
     59  1.1  mrg  * functions
     60  1.1  mrg  */
     61  1.1  mrg 
     62  1.1  mrg /*
     63  1.1  mrg  * uvm_io: perform I/O on a map
     64  1.1  mrg  *
     65  1.1  mrg  * => caller must have a reference to "map" so that it doesn't go away
     66  1.1  mrg  *    while we are working.
     67  1.1  mrg  */
     68  1.1  mrg 
     69  1.4  mrg int
     70  1.4  mrg uvm_io(map, uio)
     71  1.4  mrg 	vm_map_t map;
     72  1.4  mrg 	struct uio *uio;
     73  1.1  mrg {
     74  1.6  eeh 	vaddr_t baseva, endva, pageoffset, kva;
     75  1.6  eeh 	vsize_t chunksz, togo, sz;
     76  1.4  mrg 	vm_map_entry_t dead_entries;
     77  1.4  mrg 	int error;
     78  1.4  mrg 
     79  1.4  mrg 	/*
     80  1.4  mrg 	 * step 0: sanity checks and set up for copy loop.  start with a
     81  1.4  mrg 	 * large chunk size.  if we have trouble finding vm space we will
     82  1.4  mrg 	 * reduce it.
     83  1.4  mrg 	 */
     84  1.4  mrg 
     85  1.4  mrg 	if (uio->uio_resid == 0)
     86  1.4  mrg 		return(0);
     87  1.4  mrg 	togo = uio->uio_resid;
     88  1.4  mrg 
     89  1.6  eeh 	baseva = (vaddr_t) uio->uio_offset;
     90  1.4  mrg 	endva = baseva + (togo - 1);
     91  1.4  mrg 
     92  1.4  mrg 	if (endva < baseva)   /* wrap around? */
     93  1.4  mrg 		return(EIO);
     94  1.4  mrg 
     95  1.4  mrg 	if (baseva >= VM_MAXUSER_ADDRESS)
     96  1.4  mrg 		return(0);
     97  1.4  mrg 	if (endva >= VM_MAXUSER_ADDRESS)
     98  1.4  mrg 		/* EOF truncate */
     99  1.4  mrg 		togo = togo - (endva - VM_MAXUSER_ADDRESS + 1);
    100  1.4  mrg 	pageoffset = baseva & PAGE_MASK;
    101  1.4  mrg 	baseva = trunc_page(baseva);
    102  1.4  mrg 	chunksz = min(round_page(togo + pageoffset), MAXBSIZE);
    103  1.4  mrg 	error = 0;
    104  1.4  mrg 
    105  1.4  mrg 	/*
    106  1.4  mrg 	 * step 1: main loop...  while we've got data to move
    107  1.4  mrg 	 */
    108  1.4  mrg 
    109  1.4  mrg 	for (/*null*/; togo > 0 ; pageoffset = 0) {
    110  1.4  mrg 
    111  1.4  mrg 		/*
    112  1.4  mrg 		 * step 2: extract mappings from the map into kernel_map
    113  1.4  mrg 		 */
    114  1.1  mrg 
    115  1.4  mrg 		error = uvm_map_extract(map, baseva, chunksz, kernel_map, &kva,
    116  1.1  mrg 			    UVM_EXTRACT_QREF | UVM_EXTRACT_CONTIG |
    117  1.1  mrg 			    UVM_EXTRACT_FIXPROT);
    118  1.4  mrg 		if (error) {
    119  1.1  mrg 
    120  1.4  mrg 			/* retry with a smaller chunk... */
    121  1.4  mrg 			if (error == ENOMEM && chunksz > PAGE_SIZE) {
    122  1.4  mrg 				chunksz = trunc_page(chunksz / 2);
    123  1.4  mrg 				if (chunksz < PAGE_SIZE)
    124  1.4  mrg 					chunksz = PAGE_SIZE;
    125  1.4  mrg 				continue;
    126  1.4  mrg 			}
    127  1.4  mrg 
    128  1.4  mrg 			break;
    129  1.4  mrg 		}
    130  1.4  mrg 
    131  1.4  mrg 		/*
    132  1.4  mrg 		 * step 3: move a chunk of data
    133  1.4  mrg 		 */
    134  1.4  mrg 
    135  1.4  mrg 		sz = chunksz - pageoffset;
    136  1.4  mrg 		if (sz > togo)
    137  1.4  mrg 			sz = togo;
    138  1.4  mrg 		error = uiomove((caddr_t) (kva + pageoffset), sz, uio);
    139  1.4  mrg 		if (error)
    140  1.4  mrg 			break;
    141  1.4  mrg 		togo -= sz;
    142  1.4  mrg 		baseva += chunksz;
    143  1.4  mrg 
    144  1.4  mrg 
    145  1.4  mrg 		/*
    146  1.4  mrg 		 * step 4: unmap the area of kernel memory
    147  1.4  mrg 		 */
    148  1.4  mrg 
    149  1.4  mrg 		vm_map_lock(kernel_map);
    150  1.4  mrg 		(void)uvm_unmap_remove(kernel_map, kva, kva+chunksz, 1,
    151  1.4  mrg 		    &dead_entries);
    152  1.4  mrg 		vm_map_unlock(kernel_map);
    153  1.4  mrg 
    154  1.4  mrg 		if (dead_entries != NULL)
    155  1.4  mrg 			uvm_unmap_detach(dead_entries, AMAP_REFALL);
    156  1.4  mrg 	}
    157  1.4  mrg 
    158  1.4  mrg 	/*
    159  1.4  mrg 	 * done
    160  1.4  mrg 	 */
    161  1.1  mrg 
    162  1.4  mrg 	return (error);
    163  1.1  mrg }
    164