Home | History | Annotate | Line # | Download | only in uvm
uvm_io.c revision 1.1
      1  1.1  mrg /*	$Id: uvm_io.c,v 1.1 1998/02/05 06:25:10 mrg 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.1  mrg  */
     38  1.1  mrg 
     39  1.1  mrg /*
     40  1.1  mrg  * uvm_io.c: uvm i/o ops
     41  1.1  mrg  */
     42  1.1  mrg 
     43  1.1  mrg #include <sys/param.h>
     44  1.1  mrg #include <sys/systm.h>
     45  1.1  mrg #include <sys/mount.h>
     46  1.1  mrg #include <sys/mman.h>
     47  1.1  mrg #include <sys/proc.h>
     48  1.1  mrg #include <sys/malloc.h>
     49  1.1  mrg #include <sys/uio.h>
     50  1.1  mrg 
     51  1.1  mrg #include <vm/vm.h>
     52  1.1  mrg #include <vm/vm_page.h>
     53  1.1  mrg #include <vm/vm_kern.h>
     54  1.1  mrg 
     55  1.1  mrg #include <sys/syscallargs.h>
     56  1.1  mrg 
     57  1.1  mrg #include <uvm/uvm.h>
     58  1.1  mrg 
     59  1.1  mrg /*
     60  1.1  mrg  * functions
     61  1.1  mrg  */
     62  1.1  mrg 
     63  1.1  mrg /*
     64  1.1  mrg  * uvm_io: perform I/O on a map
     65  1.1  mrg  *
     66  1.1  mrg  * => caller must have a reference to "map" so that it doesn't go away
     67  1.1  mrg  *    while we are working.
     68  1.1  mrg  */
     69  1.1  mrg 
     70  1.1  mrg int uvm_io(map, uio)
     71  1.1  mrg 
     72  1.1  mrg vm_map_t map;
     73  1.1  mrg struct uio *uio;
     74  1.1  mrg 
     75  1.1  mrg {
     76  1.1  mrg   vm_offset_t baseva, endva, pageoffset, kva;
     77  1.1  mrg   vm_size_t chunksz, togo, sz;
     78  1.1  mrg   vm_map_entry_t dead_entries;
     79  1.1  mrg   int error;
     80  1.1  mrg 
     81  1.1  mrg   /*
     82  1.1  mrg    * step 0: sanity checks and set up for copy loop.  start with a
     83  1.1  mrg    * large chunk size.  if we have trouble finding vm space we will
     84  1.1  mrg    * reduce it.
     85  1.1  mrg    */
     86  1.1  mrg 
     87  1.1  mrg   if (uio->uio_resid == 0)
     88  1.1  mrg     return(0);
     89  1.1  mrg   togo = uio->uio_resid;
     90  1.1  mrg 
     91  1.1  mrg   baseva = (vm_offset_t) uio->uio_offset;
     92  1.1  mrg   endva = baseva + (togo - 1);
     93  1.1  mrg 
     94  1.1  mrg   if (endva < baseva)   /* wrap around? */
     95  1.1  mrg     return(EIO);
     96  1.1  mrg 
     97  1.1  mrg   if (baseva >= VM_MAXUSER_ADDRESS)
     98  1.1  mrg     return(0);
     99  1.1  mrg   if (endva >= VM_MAXUSER_ADDRESS)
    100  1.1  mrg     togo = togo - (endva - VM_MAXUSER_ADDRESS + 1); /* EOF truncate */
    101  1.1  mrg   pageoffset = baseva & PAGE_MASK;
    102  1.1  mrg   baseva = trunc_page(baseva);
    103  1.1  mrg   chunksz = min(round_page(togo + pageoffset), MAXBSIZE);
    104  1.1  mrg   error = 0;
    105  1.1  mrg 
    106  1.1  mrg   /*
    107  1.1  mrg    * step 1: main loop...  while we've got data to move
    108  1.1  mrg    */
    109  1.1  mrg 
    110  1.1  mrg   for (/*null*/; togo > 0 ; pageoffset = 0) {
    111  1.1  mrg 
    112  1.1  mrg     /*
    113  1.1  mrg      * step 2: extract mappings from the map into kernel_map
    114  1.1  mrg      */
    115  1.1  mrg 
    116  1.1  mrg     error = uvm_map_extract(map, baseva, chunksz, kernel_map, &kva,
    117  1.1  mrg 			    UVM_EXTRACT_QREF | UVM_EXTRACT_CONTIG |
    118  1.1  mrg 			    UVM_EXTRACT_FIXPROT);
    119  1.1  mrg     if (error) {
    120  1.1  mrg 
    121  1.1  mrg       /* retry with a smaller chunk... */
    122  1.1  mrg       if (error == ENOMEM && chunksz > PAGE_SIZE) {
    123  1.1  mrg 	chunksz = trunc_page(chunksz / 2);
    124  1.1  mrg 	if (chunksz < PAGE_SIZE)
    125  1.1  mrg 	  chunksz = PAGE_SIZE;
    126  1.1  mrg 	continue;
    127  1.1  mrg       }
    128  1.1  mrg 
    129  1.1  mrg       break;
    130  1.1  mrg     }
    131  1.1  mrg 
    132  1.1  mrg     /*
    133  1.1  mrg      * step 3: move a chunk of data
    134  1.1  mrg      */
    135  1.1  mrg 
    136  1.1  mrg     sz = chunksz - pageoffset;
    137  1.1  mrg     if (sz > togo)
    138  1.1  mrg       sz = togo;
    139  1.1  mrg     error = uiomove((caddr_t) (kva + pageoffset), sz, uio);
    140  1.1  mrg     if (error)
    141  1.1  mrg       break;
    142  1.1  mrg     togo -= sz;
    143  1.1  mrg     baseva += chunksz;
    144  1.1  mrg 
    145  1.1  mrg 
    146  1.1  mrg     /*
    147  1.1  mrg      * step 4: unmap the area of kernel memory
    148  1.1  mrg      */
    149  1.1  mrg 
    150  1.1  mrg     vm_map_lock(kernel_map);
    151  1.1  mrg     (void) uvm_unmap_remove(kernel_map, kva, kva+chunksz, 1, &dead_entries);
    152  1.1  mrg     vm_map_unlock(kernel_map);
    153  1.1  mrg 
    154  1.1  mrg     if (dead_entries != NULL)
    155  1.1  mrg       uvm_unmap_detach(dead_entries, AMAP_REFALL);
    156  1.1  mrg 
    157  1.1  mrg   }
    158  1.1  mrg 
    159  1.1  mrg   /*
    160  1.1  mrg    * done
    161  1.1  mrg    */
    162  1.1  mrg 
    163  1.1  mrg   return(error);
    164  1.1  mrg }
    165