Home | History | Annotate | Line # | Download | only in uvm
uvm_mremap.c revision 1.2
      1 /*	$NetBSD: uvm_mremap.c,v 1.2 2006/01/23 07:53:01 yamt Exp $	*/
      2 
      3 /*-
      4  * Copyright (c)2006 YAMAMOTO Takashi,
      5  * All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  *
     16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
     17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     26  * SUCH DAMAGE.
     27  */
     28 
     29 #include <sys/cdefs.h>
     30 __KERNEL_RCSID(0, "$NetBSD: uvm_mremap.c,v 1.2 2006/01/23 07:53:01 yamt Exp $");
     31 
     32 #include <sys/param.h>
     33 
     34 #include <uvm/uvm.h>
     35 
     36 static int
     37 uvm_mapent_extend(struct vm_map *map, vaddr_t endva, vsize_t size)
     38 {
     39 	struct vm_map_entry *entry;
     40 	struct vm_map_entry *reserved_entry;
     41 	struct uvm_object *uobj;
     42 	int error = 0;
     43 
     44 	vm_map_lock(map);
     45 	if (!uvm_map_lookup_entry(map, endva, &reserved_entry)) {
     46 		error = ENOENT;
     47 		goto done;
     48 	}
     49 	if (reserved_entry->start != endva ||
     50 	    reserved_entry->end != endva + size ||
     51 	    reserved_entry->object.uvm_obj != NULL ||
     52 	    reserved_entry->aref.ar_amap != NULL) {
     53 		error = EINVAL;
     54 		goto done;
     55 	}
     56 	entry = reserved_entry->prev;
     57 	KASSERT(&map->header != entry);
     58 	if (entry->end != endva) {
     59 		error = EINVAL;
     60 		goto done;
     61 	}
     62 
     63 	/*
     64 	 * now, make reserved_entry compatible with entry, and then
     65 	 * try to merge.
     66 	 */
     67 
     68 	uobj = entry->object.uvm_obj;
     69 	if (uobj) {
     70 		voff_t offset = entry->offset;
     71 		voff_t newoffset;
     72 
     73 		newoffset = offset + entry->end - entry->start;
     74 		if (newoffset <= offset) {
     75 			error = E2BIG; /* XXX */
     76 			goto done;
     77 		}
     78 		simple_lock(&uobj->vmobjlock);
     79 		KASSERT(uobj->uo_refs > 0);
     80 		uobj->uo_refs++;
     81 		simple_unlock(&uobj->vmobjlock);
     82 		reserved_entry->object.uvm_obj = uobj;
     83 		reserved_entry->offset = newoffset;
     84 	}
     85 	reserved_entry->etype = entry->etype;
     86 	if (UVM_ET_ISCOPYONWRITE(entry)) {
     87 		reserved_entry->etype |= UVM_ET_NEEDSCOPY;
     88 	}
     89 	reserved_entry->flags &= ~UVM_MAP_NOMERGE;
     90 	reserved_entry->protection = entry->protection;
     91 	reserved_entry->max_protection = entry->max_protection;
     92 	reserved_entry->inheritance = entry->inheritance;
     93 	reserved_entry->advice = entry->advice;
     94 	reserved_entry->wired_count = 0; /* XXX should inherit? */
     95 	uvm_mapent_trymerge(map, reserved_entry, 0);
     96 done:
     97 	vm_map_unlock(map);
     98 
     99 	return error;
    100 }
    101 
    102 /*
    103  * uvm_mremap: move and/or resize existing mappings.
    104  */
    105 
    106 int
    107 uvm_mremap(struct vm_map *oldmap,
    108     vaddr_t oldva, vsize_t oldsize,
    109     struct vm_map *newmap,
    110     vaddr_t *newvap, vsize_t newsize,
    111     struct proc *newproc,
    112     int flags)
    113 {
    114 	vaddr_t dstva;
    115 	vsize_t movesize;
    116 	vaddr_t newva;
    117 	int error = 0;
    118 	const boolean_t fixed = (flags & UVM_MREMAP_FIXED) != 0;
    119 
    120 	if (fixed) {
    121 		newva = *newvap;
    122 	} else {
    123 		newva = 0;
    124 	}
    125 	if ((oldva & PAGE_MASK) != 0 ||
    126 	    (newva & PAGE_MASK) != 0 ||
    127 	    (oldsize & PAGE_MASK) != 0 ||
    128 	    (newsize & PAGE_MASK) != 0) {
    129 		return EINVAL;
    130 	}
    131 	/* XXX zero-size should be allowed? */
    132 	if (oldva + oldsize <= oldva || newva + newsize <= newva) {
    133 		return EINVAL;
    134 	}
    135 
    136 	/*
    137 	 * check the easy cases first.
    138 	 */
    139 
    140 	if ((!fixed || newva == oldva) && newmap == oldmap) {
    141 		vaddr_t va;
    142 
    143 		if (newsize == oldsize) {
    144 			newva = oldva;
    145 			goto done;
    146 		}
    147 		if (newsize < oldsize) {
    148 			uvm_unmap(oldmap, oldva + newsize, oldva + oldsize);
    149 			newva = oldva;
    150 			goto done;
    151 		}
    152 		va = oldva + oldsize;
    153 		if (uvm_map_reserve(oldmap, newsize - oldsize, 0, 0, &va,
    154 		    UVM_FLAG_FIXED)) {
    155 			newva = oldva;
    156 			goto extend;
    157 		}
    158 		if (fixed) {
    159 			return ENOMEM;
    160 		}
    161 	}
    162 
    163 	/*
    164 	 * we need to move mappings.
    165 	 */
    166 
    167 	if (!fixed) {
    168 		KASSERT(&newproc->p_vmspace->vm_map == newmap);
    169 		newva = newproc->p_emul->e_vm_default_addr(newproc,
    170 		     (vaddr_t)newproc->p_vmspace->vm_daddr, newsize);
    171 	}
    172 	dstva = newva;
    173 	if (!uvm_map_reserve(newmap, newsize, oldva, 0, &dstva,
    174 	    fixed ? UVM_FLAG_FIXED : 0)) {
    175 		return ENOMEM;
    176 	}
    177 	KASSERT(!fixed || dstva == newva);
    178 	newva = dstva;
    179 	movesize = MIN(oldsize, newsize);
    180 	error = uvm_map_extract(oldmap, oldva, movesize, newmap, &dstva,
    181 	    UVM_EXTRACT_RESERVED);
    182 	KASSERT(dstva == newva);
    183 	if (error != 0) {
    184 		/* undo uvm_map_reserve */
    185 		uvm_unmap(newmap, newva, newva + newsize);
    186 		return error;
    187 	}
    188 	if (newsize > oldsize) {
    189 extend:
    190 		error = uvm_mapent_extend(newmap, newva + oldsize,
    191 		    newsize - oldsize);
    192 		if (error != 0) {
    193 			/* undo uvm_map_reserve and uvm_map_extract */
    194 			uvm_unmap(newmap, newva, newva + newsize);
    195 			return error;
    196 		}
    197 	}
    198 
    199 	/*
    200 	 * now we won't fail.  remove original entries.
    201 	 */
    202 
    203 	if (oldva != newva || oldmap != newmap) {
    204 		uvm_unmap(oldmap, oldva, oldva + oldsize);
    205 	}
    206 done:
    207 	*newvap = newva;
    208 	return 0;
    209 }
    210