Home | History | Annotate | Line # | Download | only in x86
xen_pmap.c revision 1.1.10.1
      1 /* $NetBSD: xen_pmap.c,v 1.1.10.1 2011/06/06 09:07:11 jruoho Exp $ */
      2 
      3 /*
      4  * Copyright (c) 2007 Manuel Bouyer.
      5  *
      6  * Redistribution and use in source and binary forms, with or without
      7  * modification, are permitted provided that the following conditions
      8  * are met:
      9  * 1. Redistributions of source code must retain the above copyright
     10  *    notice, this list of conditions and the following disclaimer.
     11  * 2. Redistributions in binary form must reproduce the above copyright
     12  *    notice, this list of conditions and the following disclaimer in the
     13  *    documentation and/or other materials provided with the distribution.
     14  *
     15  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     16  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     17  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     18  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     19  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     20  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     24  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     25  *
     26  */
     27 
     28 /*
     29  * Copyright (c) 2006 Mathieu Ropert <mro (at) adviseo.fr>
     30  *
     31  * Permission to use, copy, modify, and distribute this software for any
     32  * purpose with or without fee is hereby granted, provided that the above
     33  * copyright notice and this permission notice appear in all copies.
     34  *
     35  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
     36  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
     37  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
     38  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
     39  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
     40  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
     41  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
     42  */
     43 
     44 /*
     45  * Copyright (c) 1997 Charles D. Cranor and Washington University.
     46  * All rights reserved.
     47  *
     48  * Redistribution and use in source and binary forms, with or without
     49  * modification, are permitted provided that the following conditions
     50  * are met:
     51  * 1. Redistributions of source code must retain the above copyright
     52  *    notice, this list of conditions and the following disclaimer.
     53  * 2. Redistributions in binary form must reproduce the above copyright
     54  *    notice, this list of conditions and the following disclaimer in the
     55  *    documentation and/or other materials provided with the distribution.
     56  *
     57  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     58  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     59  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     60  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     61  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     62  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     63  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     64  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     65  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     66  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     67  */
     68 
     69 /*
     70  * Copyright 2001 (c) Wasabi Systems, Inc.
     71  * All rights reserved.
     72  *
     73  * Written by Frank van der Linden for Wasabi Systems, Inc.
     74  *
     75  * Redistribution and use in source and binary forms, with or without
     76  * modification, are permitted provided that the following conditions
     77  * are met:
     78  * 1. Redistributions of source code must retain the above copyright
     79  *    notice, this list of conditions and the following disclaimer.
     80  * 2. Redistributions in binary form must reproduce the above copyright
     81  *    notice, this list of conditions and the following disclaimer in the
     82  *    documentation and/or other materials provided with the distribution.
     83  * 3. All advertising materials mentioning features or use of this software
     84  *    must display the following acknowledgement:
     85  *      This product includes software developed for the NetBSD Project by
     86  *      Wasabi Systems, Inc.
     87  * 4. The name of Wasabi Systems, Inc. may not be used to endorse
     88  *    or promote products derived from this software without specific prior
     89  *    written permission.
     90  *
     91  * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
     92  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     93  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     94  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL WASABI SYSTEMS, INC
     95  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     96  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     97  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     98  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     99  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    100  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    101  * POSSIBILITY OF SUCH DAMAGE.
    102  */
    103 
    104 #include <sys/cdefs.h>
    105 __KERNEL_RCSID(0, "$NetBSD: xen_pmap.c,v 1.1.10.1 2011/06/06 09:07:11 jruoho Exp $");
    106 
    107 #include "opt_user_ldt.h"
    108 #include "opt_lockdebug.h"
    109 #include "opt_multiprocessor.h"
    110 #include "opt_xen.h"
    111 #if !defined(__x86_64__)
    112 #include "opt_kstack_dr0.h"
    113 #endif /* !defined(__x86_64__) */
    114 
    115 #include <sys/param.h>
    116 #include <sys/systm.h>
    117 #include <sys/proc.h>
    118 #include <sys/pool.h>
    119 #include <sys/kernel.h>
    120 #include <sys/atomic.h>
    121 #include <sys/cpu.h>
    122 #include <sys/intr.h>
    123 #include <sys/xcall.h>
    124 
    125 #include <uvm/uvm.h>
    126 
    127 #include <dev/isa/isareg.h>
    128 
    129 #include <machine/specialreg.h>
    130 #include <machine/gdt.h>
    131 #include <machine/isa_machdep.h>
    132 #include <machine/cpuvar.h>
    133 
    134 #include <x86/pmap.h>
    135 #include <x86/pmap_pv.h>
    136 
    137 #include <x86/i82489reg.h>
    138 #include <x86/i82489var.h>
    139 
    140 #ifdef XEN
    141 #include <xen/xen3-public/xen.h>
    142 #include <xen/hypervisor.h>
    143 #endif
    144 
    145 /* flag to be used for kernel mappings: PG_u on Xen/amd64, 0 otherwise */
    146 #if defined(XEN) && defined(__x86_64__)
    147 #define PG_k PG_u
    148 #else
    149 #define PG_k 0
    150 #endif
    151 
    152 extern paddr_t pmap_pa_start; /* PA of first physical page for this domain */
    153 extern paddr_t pmap_pa_end;   /* PA of last physical page for this domain */
    154 
    155 int
    156 pmap_enter(struct pmap *pmap, vaddr_t va, paddr_t pa, vm_prot_t prot, u_int flags)
    157 {
    158         paddr_t ma;
    159 
    160 	if (__predict_false(pa < pmap_pa_start || pmap_pa_end <= pa)) {
    161 		ma = pa; /* XXX hack */
    162 	} else {
    163 		ma = xpmap_ptom(pa);
    164 	}
    165 
    166 	return pmap_enter_ma(pmap, va, ma, pa, prot, flags, DOMID_SELF);
    167 }
    168 
    169 /*
    170  * pmap_kenter_ma: enter a kernel mapping without R/M (pv_entry) tracking
    171  *
    172  * => no need to lock anything, assume va is already allocated
    173  * => should be faster than normal pmap enter function
    174  * => we expect a MACHINE address
    175  */
    176 
    177 void
    178 pmap_kenter_ma(vaddr_t va, paddr_t ma, vm_prot_t prot, u_int flags)
    179 {
    180 	pt_entry_t *pte, opte, npte;
    181 
    182 	if (va < VM_MIN_KERNEL_ADDRESS)
    183 		pte = vtopte(va);
    184 	else
    185 		pte = kvtopte(va);
    186 
    187 	npte = ma | ((prot & VM_PROT_WRITE) ? PG_RW : PG_RO) |
    188 	     PG_V | PG_k;
    189 	if (flags & PMAP_NOCACHE)
    190 		npte |= PG_N;
    191 
    192 	if ((cpu_feature[2] & CPUID_NOX) && !(prot & VM_PROT_EXECUTE))
    193 		npte |= PG_NX;
    194 
    195 	opte = pmap_pte_testset (pte, npte); /* zap! */
    196 
    197 	if (pmap_valid_entry(opte)) {
    198 #if defined(MULTIPROCESSOR)
    199 		kpreempt_disable();
    200 		pmap_tlb_shootdown(pmap_kernel(), va, 0, opte);
    201 		kpreempt_enable();
    202 #else
    203 		/* Don't bother deferring in the single CPU case. */
    204 		pmap_update_pg(va);
    205 #endif
    206 	}
    207 }
    208 
    209 /*
    210  * pmap_extract_ma: extract a MA for the given VA
    211  */
    212 
    213 bool
    214 pmap_extract_ma(struct pmap *pmap, vaddr_t va, paddr_t *pap)
    215 {
    216 	pt_entry_t *ptes, pte;
    217 	pd_entry_t pde;
    218 	pd_entry_t * const *pdes;
    219 	struct pmap *pmap2;
    220 
    221 	kpreempt_disable();
    222 	pmap_map_ptes(pmap, &pmap2, &ptes, &pdes);
    223 	if (!pmap_pdes_valid(va, pdes, &pde)) {
    224 		pmap_unmap_ptes(pmap, pmap2);
    225 		kpreempt_enable();
    226 		return false;
    227 	}
    228 
    229 	pte = ptes[pl1_i(va)];
    230 	pmap_unmap_ptes(pmap, pmap2);
    231 	kpreempt_enable();
    232 
    233 	if (__predict_true((pte & PG_V) != 0)) {
    234 		if (pap != NULL)
    235 			*pap = (pte & PG_FRAME) | (va & (NBPD_L1 - 1));
    236 		return true;
    237 	}
    238 
    239 	return false;
    240 }
    241