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